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

IEEE Access

An Efficient Post-Quantum Attribute-Based Encryption Scheme Based on Rank Metric Codes for Cloud Computing

Vahid Yousefipoor, Taraneh Eghlidos

Published Jan 1, 2023• 9 citations
Publisher

Abstract

Attribute-based encryption is a valuable technique for ensuring data privacy and confidentiality in the realm of cloud computing. Using this cryptographic primitive, the data owner can securely store and share data within the cloud environment. On the other hand, in recent years, extensive advances have been made in quantum processors, which have raised hopes of solving certain mathematical problems includes factoring integers and computing discrete logarithms of large numbers. The advent of quantum computers has posed a significant security threat to existing cryptographic protocols. The existing post-quantum attribute-based encryption schemes have not satisfied the essential features such as verifiability, user privacy and user revocability, simultaneously. In this paper, we present the first secure, practical and post-quantum attribute-based encryption scheme based on rank metric codes. Our scheme enjoys all mentioned features due to utilization of low rank parity check codes. The proposed scheme provides security against chosen plaintext attacks in the standard model, as well as resistance against reaction attacks as a kind of chosen ciphertext attacks. Moreover, at the 256-bit security level, the key size is about 16.5 KB, with an execution time of around 31.2 ms on a desktop. Our implementation results confirm that the proposed scheme is more efficient than the existing post-quantum and classical schemes.

DOI
10.1109/access.2023.3313098

Related papers

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

An IND-CCA2 secure post-quantum encryption scheme and a secure cloud storage use case

Peng Zeng, Siyuan Chen, Kim‐Kwang Raymond Choo

Abstract Code-based public key encryption (PKE) is a popular choice to achieve post-quantum security, partly due to its capability to achieve fast encryption/decryption. However, code-based PKE has larger ciphertext and public key sizes in comparison to conventional PKE schemes (e.g., those based on RSA). In 2018, Lau and Tan proposed a new rank metric code-based PKE scheme, which has smaller public key and ciphertext sizes compared to other code-based PKE schemes. They also proved that their scheme achieves IND-CPA security, assuming the intractability of the decisional rank syndrome decoding problem. It is known that IND-CCA2 security is the strongest and most popular security assurance for PKE schemes. Therefore, in this paper, we obtain a new code-based PKE scheme from Lau and Tan’s scheme, in order to inherit the underlying small public key and ciphertext sizes. However, our new scheme is shown to achieve IND-CCA2 security, instead of the weaker IND-CPA security. Specifically, the respective public key size and ciphertext size in our new scheme are 15.06 KB and 1.37 KB under 141-bit security level, and 16.76 KB and 1.76 KB under 154-bit security level. We then present a use case for the proposed scheme, that is for secure cloud storage.

Human-centric Computing and Information Sciences•Sep 1, 2019•10 citations

Post-Quantum Cryptographic Algorithms for Secure Communication in Decentralized Blockchain and Cloud Infrastructure

The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.

International Journal of Computer Applications Technology and Research•Feb 13, 2025•7 citations

Attribute-based encryption supporting data filtration over post-quantum assumptions

Chunhong Jiao, Xinyin Xiang

As the internet becomes prevalent, plenty of sensitive data is being transferred in open networks environment. It is worth concerning how to achieve efficient data transfer in a privacy-preserving manner. Although attribute-based encryption (ABE) can achieve fine-grained access control over encrypted data, it still could not work for restricting unauthorised user to access. In this paper, we introduce a new cryptographic primitive called attribute-based encryption supporting data filtration (ABE-SDF), and formalise the security mode by incorporating the advantages into previous ABE. Finally, we present an efficient construction of the scheme over post-quantum assumptions our scheme is believed to be quantum-resistant owing to the special property of lattices. Based on the LWE assumption, we prove that the proposed scheme has the indistinguishability against selective chosen plaintext attacks and the authentication information security.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2018•0 citations

Hybrid Post-Quantum Cryptographic Framework for High-Performance Secure Data Transmission

Timur A. Khudaybergenov, Худайберганов Темур Рустамович, Temur Takhirovich Turdiyev +1 more

The rapid development of quantum computing presents a substantial threat to traditional cryptographic algorithms, particularly those relying on mathematical problems such as integer factorization and elliptic curve operations. As a response, the cryptographic community has accelerated the design of post-quantum cryptographic schemes that can withstand attacks from both classical and quantum computers. However, many of these new schemes exhibit inherent trade-offs between performance, key sizes, and implementation complexity. To address this, we propose a novel hybrid cryptographic framework tailored for secure and efficient data transmission in future quantum-aware environments. The proposed system combines three algorithmic paradigms: a lattice-based encryption method for fast and lightweight data protection, a hash-based signature mechanism for authenticity, and a code-based key exchange method to ensure session confidentiality. This layered integration is designed to capitalize on each algorithm’s strengths while mitigating individual limitations. The system is implemented using modular components in a testbed simulating real-world deployments, and its performance is benchmarked across multiple metrics including encryption latency, signature generation time, key sizes, and throughput. Comparative results indicate that the hybrid approach outperforms monolithic schemes in critical areas such as execution time and cryptographic strength under quantum adversary models. The findings support the practicality of using multiple post-quantum primitives in tandem to build robust communication systems. This research contributes a realistic implementation and evaluation of post-quantum security models and highlights key directions for future research and standardization efforts as the global transition to quantum-safe infrastructure begins.

International Scientific-Technical Conference on Actual Problems of Electronic Instrument Engineering (APEIE)•Nov 14, 2025•0 citations

Secure and Reliable Data Transfer for Cloud Computing with Quantum Key Distribution.

S. Rajendirakumar

The increasing use of cloud computing has raised concerns about the security of sensitive data. Quantum computers pose a serious threat to the security of traditional encryption schemes, as they could be used to break these schemes in a relatively short amount of time. Quantum cryptography offers a promising solution to this problem, as it provides a secure way to exchange keys that cannot be broken by quantum computers. In this paper, we propose a novel data security scheme for cloud computing that uses quantum key distribution (QKD). The scheme uses a QKD protocol to establish a shared secret key between the cloud server and the client. This key is then used to encrypt the data before it is sent to the cloud server. The scheme also proposes a new method for verifying the integrity of the data after it has been decrypted. The proposed scheme is secure against both classical and quantum attacks. It is also efficient, as it does not require the transmission of large amounts of data. The scheme is also scalable, as it can be easily implemented in cloud computing environments.

•Apr 6, 2023•2 citations
Attribute-based encryption is a valuable technique for ensuring data privacy and confidentiality in the realm of cloud computing. Using this cryptographic primitive, the data owner can securely store and share data within the cloud environment. On the other hand, in recent years, extensive advances have been made in quantum processors, which have raised hopes of solving certain mathematical problems includes factoring integers and computing discrete logarithms of large numbers. The advent of quantum computers has posed a significant security threat to existing cryptographic protocols. The existing post-quantum attribute-based encryption schemes have not satisfied the essential features such as verifiability, user privacy and user revocability, simultaneously. In this paper, we present the first secure, practical and post-quantum attribute-based encryption scheme based on rank metric codes. Our scheme enjoys all mentioned features due to utilization of low rank parity check codes. The proposed scheme provides security against chosen plaintext attacks in the standard model, as well as resistance against reaction attacks as a kind of chosen ciphertext attacks. Moreover, at the 256-bit security level, the key size is about 16.5 KB, with an execution time of around 31.2 ms on a desktop. Our implementation results confirm that the proposed scheme is more efficient than the existing post-quantum and classical schemes.
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.
Abstract Code-based public key encryption (PKE) is a popular choice to achieve post-quantum security, partly due to its capability to achieve fast encryption/decryption. However, code-based PKE has larger ciphertext and public key sizes in comparison to conventional PKE schemes (e.g., those based on RSA). In 2018, Lau and Tan proposed a new rank metric code-based PKE scheme, which has smaller public key and ciphertext sizes compared to other code-based PKE schemes. They also proved that their scheme achieves IND-CPA security, assuming the intractability of the decisional rank syndrome decoding problem. It is known that IND-CCA2 security is the strongest and most popular security assurance for PKE schemes. Therefore, in this paper, we obtain a new code-based PKE scheme from Lau and Tan’s scheme, in order to inherit the underlying small public key and ciphertext sizes. However, our new scheme is shown to achieve IND-CCA2 security, instead of the weaker IND-CPA security. Specifically, the respective public key size and ciphertext size in our new scheme are 15.06 KB and 1.37 KB under 141-bit security level, and 16.76 KB and 1.76 KB under 154-bit security level. We then present a use case for the proposed scheme, that is for secure cloud storage.
The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.
As the internet becomes prevalent, plenty of sensitive data is being transferred in open networks environment. It is worth concerning how to achieve efficient data transfer in a privacy-preserving manner. Although attribute-based encryption (ABE) can achieve fine-grained access control over encrypted data, it still could not work for restricting unauthorised user to access. In this paper, we introduce a new cryptographic primitive called attribute-based encryption supporting data filtration (ABE-SDF), and formalise the security mode by incorporating the advantages into previous ABE. Finally, we present an efficient construction of the scheme over post-quantum assumptions our scheme is believed to be quantum-resistant owing to the special property of lattices. Based on the LWE assumption, we prove that the proposed scheme has the indistinguishability against selective chosen plaintext attacks and the authentication information security.
The rapid development of quantum computing presents a substantial threat to traditional cryptographic algorithms, particularly those relying on mathematical problems such as integer factorization and elliptic curve operations. As a response, the cryptographic community has accelerated the design of post-quantum cryptographic schemes that can withstand attacks from both classical and quantum computers. However, many of these new schemes exhibit inherent trade-offs between performance, key sizes, and implementation complexity. To address this, we propose a novel hybrid cryptographic framework tailored for secure and efficient data transmission in future quantum-aware environments. The proposed system combines three algorithmic paradigms: a lattice-based encryption method for fast and lightweight data protection, a hash-based signature mechanism for authenticity, and a code-based key exchange method to ensure session confidentiality. This layered integration is designed to capitalize on each algorithm’s strengths while mitigating individual limitations. The system is implemented using modular components in a testbed simulating real-world deployments, and its performance is benchmarked across multiple metrics including encryption latency, signature generation time, key sizes, and throughput. Comparative results indicate that the hybrid approach outperforms monolithic schemes in critical areas such as execution time and cryptographic strength under quantum adversary models. The findings support the practicality of using multiple post-quantum primitives in tandem to build robust communication systems. This research contributes a realistic implementation and evaluation of post-quantum security models and highlights key directions for future research and standardization efforts as the global transition to quantum-safe infrastructure begins.
The increasing use of cloud computing has raised concerns about the security of sensitive data. Quantum computers pose a serious threat to the security of traditional encryption schemes, as they could be used to break these schemes in a relatively short amount of time. Quantum cryptography offers a promising solution to this problem, as it provides a secure way to exchange keys that cannot be broken by quantum computers. In this paper, we propose a novel data security scheme for cloud computing that uses quantum key distribution (QKD). The scheme uses a QKD protocol to establish a shared secret key between the cloud server and the client. This key is then used to encrypt the data before it is sent to the cloud server. The scheme also proposes a new method for verifying the integrity of the data after it has been decrypted. The proposed scheme is secure against both classical and quantum attacks. It is also efficient, as it does not require the transmission of large amounts of data. The scheme is also scalable, as it can be easily implemented in cloud computing environments.