Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

O2, repositorio institucional de la UOC
Publication Contribución de congreso (ConferenceOutput)

Classification of attribute-based encryption based on access policy contents

  • Mahdavi, Mahdi
  • Ahmadian, Zahra
  • Rifà-Pous, Helena
Securing sensitive data in complex, AI-driven, evolving networks like 6G and IoT requires fine-grained access control mechanisms. Attribute- Based Encryption (ABE) addresses this need by enforcing access policies directly on encrypted data. While traditional ABE schemes rely on Boolean circuits to represent access policies, recent advances have introduced arithmetic circuits, which provide greater expressiveness and flexibility for modelling complex access requirements.This paper proposes a novel categorization of ABE schemes based on the visibility and location of access policy components, access structure and attribute set, within the ciphertext or secret key. Additionally, it introduces the concept of Hidden Result Attribute Based Encryption (HR-ABE) for arithmetic circuits, with two main variants: Hidden Result Key Policy Attribute-Based Encryption (HR-KP-ABE) and Hidden Result Ciphertext Policy Attribute-Based Encryption (HR-CP-ABE). This categorization facilitates the design of application-specific ABE schemes, allowing tailored security solutions across a wide range of use cases,such as cloud storage, healthcare, and dynamic multi-user environments.
O2, repositorio institucional de la UOC
Publication Contribución de congreso (ConferenceOutput)

A modified schnorr sigma protocol and its application to isogeny-based identification

  • Mahdavi Oliaee, Mahdi
  • Pindado Tost, Zaira
  • Sakhaie, Amineh
  • Rifà-Pous, Helena
Quantum computing threatens classical cryptographic protocols like the Schnorr identification scheme, which relies on the Discrete Logarithm Problem (DLP), vulnerable to quantum attacks. In this paper, we propose a modification to the classical Schnorr protocol by redefining the prover response as r = cu±x mod q instead of r = u+cx mod q. While this adjust- ment preserves the arithmetic simplicity of the original protocol, it introduces subtle but significant changes to the protocol’s security and verifiability. We analyze its soundness, zero-knowledge properties, extractor functionality, and practical viability, and explore its adaptation into a secure digital signature system under standard cryptographic assumptions. To underscore the practical significance of our approach, we implement the modified protocol within an isogeny-based framework, demonstrating its capacity to enhance an existing identification scheme with respect to both security and efficiency. Our findings illustrate that revisiting classical protocols through judicious modifications can yield more robust, quantum-resistant solutions for applications like blockchain.