Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Security and Cryptography

Classical to Post-Quantum Secure ABE-IBE Proxy Re-Encryption Scheme

Muhammad Nauman Khan, Asha Rao, Seyit Ahmet Camtepe, Josef Pieprzyk

Published Jan 1, 2023• 5 citations
Publisher

Abstract

Maintaining data confidentiality at the asymmetric-resource devices across emerging technologies needs varying cryptographic algorithms. Quantum computing makes preserving data confidentiality across asymmetric infrastructure more difficult. However, exploiting the architecture of classical cryptographic schemes to integrate the post-quantum constructs could be used to maintain post-quantum level confidentiality over the Internet. This paper presents a post-quantum secure classical ABE-IBE proxy re-encryption scheme (L ABE-IBE PRE) that utilizes the classical ABE-IBE proxy re-encryption capabilities at the end nodes in a system and raises the data confidentiality to post-quantum secure level over the Internet. The proposed L ABE-IBE PRE transforms a ciphertext of the classical ABE scheme to a post-quantum secure ciphertext and from a post-quantum secure ciphertext to a ciphertext of the classical IBE scheme. We compare our proposed L ABE-IBE PRE scheme with classical ABE-IBE proxy re-encryption schemes, including Encryption Switching ABE-IBE (ES.ABE-IBE) scheme (He et al., 2019). We discuss the security and efficiency of our proposed scheme.

DOI
10.5220/0012078200003555

Related papers

Lattice-based ABE-IBE Proxy Re-Encryption for IoT Systems

Muhammad Nauman Khan, Asha Rao, Seyit Ahmet Camtepe +1 more

The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction.

•Mar 15, 2022•0 citations

Lattice-based ABE-IBE Proxy Re-Encryption for IoT Systems

Muhammad Nauman Khan, Asha Rao, Seyit Ahmet Camtepe +1 more

The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction.

•Mar 16, 2022•1 citation

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Zulianie Binti Jemihin, Tan Soo Fun, Gwo Chin Chung

Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.

Cryptography•Aug 5, 2022•26 citations

Proxy re-encryption scheme based on BB2 identity based encryption

Xiaoyuan Yang, Xu An Wang

In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. They predicated that proxy re-encryption and re-signature will play an important role in our life. In 2007, Matsuo proposed the concept of four types of re-encryption schemes: CBE to IBE(type 1), IBE to IBE(type 2), IBE to CBE (type 3), CBE to CBE (type 4 ). Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working group. One feature of proxy re-encryption schemes proposed by Matsuo is that they are all based on BB1 identity based encryption.We ask question like this: can we construct proxy re-encryption schemes based on BB2 identity based encryption? We give affirmative answer to this question. We construct an IBE to IBE proxy re-encryption scheme based on BB2 with the help of PKG and prove its security in the standard model.

IEEE International Conference on Computer Science and Information Technology•Jan 1, 2009•4 citations

A New Cryptographic Frontier: Key-Independent Security and Post-Quantum Hardness Assumptions

Abdelkader Laouid, Mostefa Kara, Mohammad Ali A. Hammoudeh

With the rapid advancement of quantum computing, many classical encryption schemes are becoming increasingly vulnerable to quantum attacks, highlighting the urgent need for post-quantum cryptographic solutions that can withstand this emerging threat. In this context, this paper introduces the Q-Problem, a novel post-quantum hardness assumption specifically designed to resist quantum adversaries by presenting them with a vast and computationally infeasible preimage space. Building on this foundation, we propose Q-KIE (a post-quantum key-independent encryption scheme), which replaces persistent cryptographic keys with ephemeral, message-bound secret holders. Q-KIE features dynamic complexity tuning, offering flexible security levels and maintaining efficient performance across both classical and quantum computing environments. Detailed analysis and comprehensive evaluations demonstrate the scheme's strong potential in preserving confidentiality, integrity, and computational practicality, positioning it as a promising candidate for hybrid and post-quantum cryptographic frameworks.

IEEE Open Journal of the Computer Society•Jan 1, 2025•1 citation

Lightweight Public Key Encryption in Post-Quantum Computing Era

Peter Hillmann

Confidentiality in our digital world is based on the security of cryptographic algorithms. These are usually executed transparently in the background, with people often relying on them without further knowledge. In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened. This particularly affects public-key methods such as RSA and DH based on discrete logarithms and prime factorization. Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class. Thereby the approach of CramerShoup is put on the new basis of elliptic curves. The system is provable cryptographically strong, especially against adaptive chosen-ciphertext attacks. In addition, the new method features small key lengths, making it suitable for Internet-of-Things. It represents an intermediate step towards an encryption scheme based on isogeny elliptic curves. This approach shows a way to a secure encryption scheme for the post-quantum computing era.

arXiv:2311.14845•Nov 18, 2023•1 citation
Maintaining data confidentiality at the asymmetric-resource devices across emerging technologies needs varying cryptographic algorithms. Quantum computing makes preserving data confidentiality across asymmetric infrastructure more difficult. However, exploiting the architecture of classical cryptographic schemes to integrate the post-quantum constructs could be used to maintain post-quantum level confidentiality over the Internet. This paper presents a post-quantum secure classical ABE-IBE proxy re-encryption scheme (L ABE-IBE PRE) that utilizes the classical ABE-IBE proxy re-encryption capabilities at the end nodes in a system and raises the data confidentiality to post-quantum secure level over the Internet. The proposed L ABE-IBE PRE transforms a ciphertext of the classical ABE scheme to a post-quantum secure ciphertext and from a post-quantum secure ciphertext to a ciphertext of the classical IBE scheme. We compare our proposed L ABE-IBE PRE scheme with classical ABE-IBE proxy re-encryption schemes, including Encryption Switching ABE-IBE (ES.ABE-IBE) scheme (He et al., 2019). We discuss the security and efficiency of our proposed scheme.
The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction.
The recent expansion of the Internet of things (IoT) and its applications continues to dramatically change the IT services supporting manufacturing, energy management, intelligent transportation, smart cities, etc. These IT services often interconnect Internet-based Cloud systems with IoT or intelligent smart devices held by organisations. As IoT devices are resource-limited, the security of their communication is provided by lightweight cryptography that could consequently lead to the devices being insecure against a quantum adversary. On the other hand, Internet Cloud systems are resource-rich and could easily support post-quantum cryptography. This paper presents a proxy re-encryption scheme that translates ciphertexts of a classical lightweight encryption algorithm into their post quantum equivalent and vice versa. More precisely, we propose a lattice-based ABE-IBE (L ABE-IBE) proxy re-encryption scheme that transforms a classical lightweight ciphertext into a lattice based ciphertext. We compare our proposed L ABE-IBE proxy re-encryption scheme with classical proxy re-encryption (ABEIBE) schemes. We discuss the security and efficiency of our construction.
Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.
In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. They predicated that proxy re-encryption and re-signature will play an important role in our life. In 2007, Matsuo proposed the concept of four types of re-encryption schemes: CBE to IBE(type 1), IBE to IBE(type 2), IBE to CBE (type 3), CBE to CBE (type 4 ). Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working group. One feature of proxy re-encryption schemes proposed by Matsuo is that they are all based on BB1 identity based encryption.We ask question like this: can we construct proxy re-encryption schemes based on BB2 identity based encryption? We give affirmative answer to this question. We construct an IBE to IBE proxy re-encryption scheme based on BB2 with the help of PKG and prove its security in the standard model.
With the rapid advancement of quantum computing, many classical encryption schemes are becoming increasingly vulnerable to quantum attacks, highlighting the urgent need for post-quantum cryptographic solutions that can withstand this emerging threat. In this context, this paper introduces the Q-Problem, a novel post-quantum hardness assumption specifically designed to resist quantum adversaries by presenting them with a vast and computationally infeasible preimage space. Building on this foundation, we propose Q-KIE (a post-quantum key-independent encryption scheme), which replaces persistent cryptographic keys with ephemeral, message-bound secret holders. Q-KIE features dynamic complexity tuning, offering flexible security levels and maintaining efficient performance across both classical and quantum computing environments. Detailed analysis and comprehensive evaluations demonstrate the scheme's strong potential in preserving confidentiality, integrity, and computational practicality, positioning it as a promising candidate for hybrid and post-quantum cryptographic frameworks.
Confidentiality in our digital world is based on the security of cryptographic algorithms. These are usually executed transparently in the background, with people often relying on them without further knowledge. In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened. This particularly affects public-key methods such as RSA and DH based on discrete logarithms and prime factorization. Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class. Thereby the approach of CramerShoup is put on the new basis of elliptic curves. The system is provable cryptographically strong, especially against adaptive chosen-ciphertext attacks. In addition, the new method features small key lengths, making it suitable for Internet-of-Things. It represents an intermediate step towards an encryption scheme based on isogeny elliptic curves. This approach shows a way to a secure encryption scheme for the post-quantum computing era.