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 Transactions on Consumer Electronics

Secure and Privacy-Preserving Post-Quantum Attribute-Based Searchable Encryption for Edge-Driven Transportation Systems

Chintureena Thingom, Bhagavan Konduri, Isha Das, V. Rama Krishna, Rahul Suryoda, Shrabani Mallick, Faheem Ahmad Reegu, Feruza Saidova, Deepak Kumar Goyal

Published Nov 12, 2025• 2 citations
Publisher

Abstract

To address the risks of data leakage and unauthorized access in Intelligent Transportation Systems (ITS), particularly in the post-quantum era where traditional cryptographic algorithms are vulnerable, this paper proposes a novel Post-Quantum Attribute-Based Searchable Encryption (PQ-ABSE) scheme. The scheme is designed to resist quantum attacks while providing privacy-preserving search, key aggregation, and lightweight computation. The proposed PQ-ABSE scheme ensures end-to-end privacy protection during key generation, access control, and partial decryption phases. By embedding search keywords into the access policy, it achieves partial policy hiding and ensures keyword confidentiality under quantum-resilient assumptions. Moreover, by leveraging key aggregation techniques, the scheme consolidates all file identifiers that meet both the search and access conditions into a single aggregate key, significantly reducing user-side key storage overhead while ensuring file and data security. Security analysis confirms that the scheme achieves hidden access structure security, keyword ciphertext indistinguishability, and trapdoor indistinguishability in a post-quantum setting. Theoretical analysis and simulation results further demonstrate the scheme’s practicality and efficiency in terms of both computational and communication overhead, making it a promising solution for post-quantum secure ITS data management.

DOI
10.1109/tce.2025.3632071

Related papers

Multi-Authority Attribute-Based Multi-Keyword Searchable Encryption with Dynamic Membership from Lattices

Er-Shuo Zhuang, Chia‐Yu Lin, Chun‐I Fan +2 more

With the growing need for secure cloud storage and the threat of quantum attacks, we propose a post-quantum secure lattice-based multi-authority attribute-based multi-keyword searchable encryption scheme with dynamic membership. Based on the decisional learning with errors assumption, the proposed scheme resists quantum adversaries while supporting flexible multi-keyword search, decentralized authority to avoid key escrow, and dynamic attribute updates without affecting other users. It enables users to independently generate search tokens, allowing offline authorities and reducing communication overhead. Despite higher encryption costs, experimental results demonstrate that search and decryption remain efficient compared to existing post-quantum lattice-based solutions. The proposed scheme achieves strong data confidentiality and keyword privacy in the post-quantum setting.

IEEE Conference on Dependable and Secure Computing (DSC)•Oct 18, 2025•0 citations

QPASE: Quantum-Resistant Password-Authenticated Searchable Encryption for Cloud Storage

Jingwei Jiang, Ding Wang

Searchable encryption is a powerful tool that enables secure and private searches of encrypted data. It allows users to outsource their data to cloud servers while maintaining the confidentiality and privacy of their data. Password-authenticated symmetric searchable encryption (PASE) can help users avoid the complexity and security risks associated with key management while maintaining the advantages of searchable encryption. To the best of our knowledge, none of the existing PASE schemes can resist security threats in the post-quantum era, and there is an urgent need to design quantum-resistant solutions. However, post-quantum cryptography (e.g., lattice-based cryptography) varies significantly from traditional cryptography, and it is challenging to design a quantum-resistant PASE for cloud storage. In this work, we take the first step towards this challenge by proposing QPASE, a quantum-resistant password-authenticated symmetric searchable encryption for cloud storage. We employ lattice-based threshold oblivious pseudorandom function (TOPRF) to achieve password re-randomization and formally prove that QPASE is authentication secure and indistinguishability against chosen keyword attacks (IND-CKA) secure under quantum computers. QPASE can be extended to multi-keyword search and allows servers to update keys without affecting the users. The comparison results show that QPASE outperforms its foremost counterparts in security and computation overhead.

IEEE Transactions on Information Forensics and Security•Jan 1, 2024•21 citations

Post-Quantum Searchable Encryption Supporting User-Authorization for Outsourced Data Management

Shiyuan Xu, Yibo Cao, Xue Chen +4 more

With the widespread development of database systems, data security has become crucial when it comes to sharing among users and servers. A straightforward approach involves using searchable encryption to ensure the confidentiality of shared data. However, in certain scenarios, varying user tiers are granted disparate data searching privileges, and administrators need to restrict the searchability of ciphertexts to select users exclusively. To address this issue, public key encryption with authorized keyword search (PEAKS) was proposed, wherein solely authorized users possess the ability to conduct targeted keyword searches. Nonetheless, it is vulnerable to resist quantum computing attacks. As a result, research focusing on authorizing users to search for keywords while achieving quantum security is far-reaching. In this paper, we propose a lattice-based variant of PEAKS (L-PEAKS) that enables keyword dataset authorization for outsourced data management. Unlike existing schemes, our design incorporates identity-based encryption (IBE) to overcome the bottleneck of public key management. Besides, we utilize several lattice sampling algorithms to defend against attacks from quantum adversaries. Specifically, each authorized user must obtain a search privilege from an authority. The authority distributes an authorized token to the user within a specific time period, and the user generates a trapdoor for any authorized keywords. Our scheme is proven to be secure against IND-sID-CKA and T-EUF security in a quantum setting. We also conduct comprehensive evaluations on a commodity machine to assess completeness and provide theoretical complexity comparisons with existing state-of-the-art schemes.

ACM International Conference on Information and Knowledge Management (CIKM)•Oct 20, 2024•14 citations

A Searchable Encryption Scheme Based on CRYSTALS-Dilithium

Minghui Zheng, Anqi Xiao, Shicheng Huang +1 more

With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender–receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.

Cryptography•Mar 27, 2026•0 citations

Semantic Searchable Encryption Scheme based on Lattice in Quantum-era

Yang Yang, Maode Ma

Abstract. When data is outsourced to a remote storage server, search-able encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. These schemes may not be secure in the quantum age. Both discrete logarithms and factorization can be solved by quantum computer in a polynomial time. There is very few searchable encryption scheme that can be proved secure in post quantum age. In this paper, in order to construct a post-quantum secure scheme for future cloud stor-age, we suggest a public key encryption with semantic keyword search using the lattice based mechanism. The suggested scheme is proved se-cure against indistinguishable chosen-keyword attacks (IND-CKA) based on learning with errors (LWE) problem. This scheme is believed to be secure in quantum-era due to the quantum intractability of the LWE problem.

Journal of information science and engineering•Jan 1, 2016•11 citations

Ensuring Confidentiality in Future Systems with Advanced Post-Quantum Cryptographic Solutions

Purvi Pareek, Mahesh Soni, Sowjanya Karri +3 more

This research paper addresses the growing challenge of maintaining data confidentiality in a future where quantum-enabled attackers can undermine the cryptographic foundations of existing security systems. While emerging post-quantum standards mainly aim to replace classical public-key primitives, they leave critical gaps in managing symmetric key lifecycles, enabling secure encrypted search, and supporting multi-party access control. To bridge these gaps, this work proposes a unified post-quantum confidentiality framework built on a punctual-ratchet lattice-based encapsulation scheme. The design combines module-LWE key encapsulation with a punctual symmetric ratchet, establishing a quantum-resistant bootstrap secret and enabling continuous forward secrecy. Key evolution is achieved through a puncturable PRF mechanism that allows selective invalidation of prior decryption keys with minimal overhead and compact verifiability. Using the same ratchet state, an encrypted indexing layer is constructed to support efficient, privacy-preserving querying across large ciphertext repositories while limiting long-term query pattern leakage. The framework preserves confidentiality even when devices face delayed compromise, and it scales effectively through lightweight client-side rekey capsules compatible with high-throughput infrastructures. Experimental results show that encapsulation costs can be amortized, ratchet steps remain lightweight, and metadata growth stays sublinear. Overall, the proposed system provides a practical and secure foundation for future post-quantum cybersecurity architectures.

International Conference Communication, Networks & Computing•Dec 29, 2025•0 citations
To address the risks of data leakage and unauthorized access in Intelligent Transportation Systems (ITS), particularly in the post-quantum era where traditional cryptographic algorithms are vulnerable, this paper proposes a novel Post-Quantum Attribute-Based Searchable Encryption (PQ-ABSE) scheme. The scheme is designed to resist quantum attacks while providing privacy-preserving search, key aggregation, and lightweight computation. The proposed PQ-ABSE scheme ensures end-to-end privacy protection during key generation, access control, and partial decryption phases. By embedding search keywords into the access policy, it achieves partial policy hiding and ensures keyword confidentiality under quantum-resilient assumptions. Moreover, by leveraging key aggregation techniques, the scheme consolidates all file identifiers that meet both the search and access conditions into a single aggregate key, significantly reducing user-side key storage overhead while ensuring file and data security. Security analysis confirms that the scheme achieves hidden access structure security, keyword ciphertext indistinguishability, and trapdoor indistinguishability in a post-quantum setting. Theoretical analysis and simulation results further demonstrate the scheme’s practicality and efficiency in terms of both computational and communication overhead, making it a promising solution for post-quantum secure ITS data management.
With the growing need for secure cloud storage and the threat of quantum attacks, we propose a post-quantum secure lattice-based multi-authority attribute-based multi-keyword searchable encryption scheme with dynamic membership. Based on the decisional learning with errors assumption, the proposed scheme resists quantum adversaries while supporting flexible multi-keyword search, decentralized authority to avoid key escrow, and dynamic attribute updates without affecting other users. It enables users to independently generate search tokens, allowing offline authorities and reducing communication overhead. Despite higher encryption costs, experimental results demonstrate that search and decryption remain efficient compared to existing post-quantum lattice-based solutions. The proposed scheme achieves strong data confidentiality and keyword privacy in the post-quantum setting.
Searchable encryption is a powerful tool that enables secure and private searches of encrypted data. It allows users to outsource their data to cloud servers while maintaining the confidentiality and privacy of their data. Password-authenticated symmetric searchable encryption (PASE) can help users avoid the complexity and security risks associated with key management while maintaining the advantages of searchable encryption. To the best of our knowledge, none of the existing PASE schemes can resist security threats in the post-quantum era, and there is an urgent need to design quantum-resistant solutions. However, post-quantum cryptography (e.g., lattice-based cryptography) varies significantly from traditional cryptography, and it is challenging to design a quantum-resistant PASE for cloud storage. In this work, we take the first step towards this challenge by proposing QPASE, a quantum-resistant password-authenticated symmetric searchable encryption for cloud storage. We employ lattice-based threshold oblivious pseudorandom function (TOPRF) to achieve password re-randomization and formally prove that QPASE is authentication secure and indistinguishability against chosen keyword attacks (IND-CKA) secure under quantum computers. QPASE can be extended to multi-keyword search and allows servers to update keys without affecting the users. The comparison results show that QPASE outperforms its foremost counterparts in security and computation overhead.
With the widespread development of database systems, data security has become crucial when it comes to sharing among users and servers. A straightforward approach involves using searchable encryption to ensure the confidentiality of shared data. However, in certain scenarios, varying user tiers are granted disparate data searching privileges, and administrators need to restrict the searchability of ciphertexts to select users exclusively. To address this issue, public key encryption with authorized keyword search (PEAKS) was proposed, wherein solely authorized users possess the ability to conduct targeted keyword searches. Nonetheless, it is vulnerable to resist quantum computing attacks. As a result, research focusing on authorizing users to search for keywords while achieving quantum security is far-reaching. In this paper, we propose a lattice-based variant of PEAKS (L-PEAKS) that enables keyword dataset authorization for outsourced data management. Unlike existing schemes, our design incorporates identity-based encryption (IBE) to overcome the bottleneck of public key management. Besides, we utilize several lattice sampling algorithms to defend against attacks from quantum adversaries. Specifically, each authorized user must obtain a search privilege from an authority. The authority distributes an authorized token to the user within a specific time period, and the user generates a trapdoor for any authorized keywords. Our scheme is proven to be secure against IND-sID-CKA and T-EUF security in a quantum setting. We also conduct comprehensive evaluations on a commodity machine to assess completeness and provide theoretical complexity comparisons with existing state-of-the-art schemes.
With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender–receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.
Abstract. When data is outsourced to a remote storage server, search-able encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. These schemes may not be secure in the quantum age. Both discrete logarithms and factorization can be solved by quantum computer in a polynomial time. There is very few searchable encryption scheme that can be proved secure in post quantum age. In this paper, in order to construct a post-quantum secure scheme for future cloud stor-age, we suggest a public key encryption with semantic keyword search using the lattice based mechanism. The suggested scheme is proved se-cure against indistinguishable chosen-keyword attacks (IND-CKA) based on learning with errors (LWE) problem. This scheme is believed to be secure in quantum-era due to the quantum intractability of the LWE problem.
This research paper addresses the growing challenge of maintaining data confidentiality in a future where quantum-enabled attackers can undermine the cryptographic foundations of existing security systems. While emerging post-quantum standards mainly aim to replace classical public-key primitives, they leave critical gaps in managing symmetric key lifecycles, enabling secure encrypted search, and supporting multi-party access control. To bridge these gaps, this work proposes a unified post-quantum confidentiality framework built on a punctual-ratchet lattice-based encapsulation scheme. The design combines module-LWE key encapsulation with a punctual symmetric ratchet, establishing a quantum-resistant bootstrap secret and enabling continuous forward secrecy. Key evolution is achieved through a puncturable PRF mechanism that allows selective invalidation of prior decryption keys with minimal overhead and compact verifiability. Using the same ratchet state, an encrypted indexing layer is constructed to support efficient, privacy-preserving querying across large ciphertext repositories while limiting long-term query pattern leakage. The framework preserves confidentiality even when devices face delayed compromise, and it scales effectively through lightweight client-side rekey capsules compatible with high-throughput infrastructures. Experimental results show that encapsulation costs can be amortized, ratchet steps remain lightweight, and metadata growth stays sublinear. Overall, the proposed system provides a practical and secure foundation for future post-quantum cybersecurity architectures.