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

China Communications

Identity-based encryption with keyword search from lattice assumption

Xiaojun Zhang, Chunxiang Xu, Liming Mu, Jie Zhao

Published Apr 1, 2018• 18 citations
Publisher

Abstract

Public key encryption scheme with keyword search (PEKS) enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any information about the encrypted data without the trapdoor corresponding to the keyword. The PEKS is useful to keep the management of large data storages secure such as those in a cloud. In this paper, to protect against quantum computer attacks, we present a lattice-based identity-based encryption scheme with keyword search. We have proved that our scheme can achieve ciphertext indistinguishability in the random oracle model, and our scheme can also achieve trapdoor security. In particular, our scheme can designate a unique tester to test and return the search results, therefore it does not need a secure channel. To the best of our knowledge, our scheme is the first identity- based encryption scheme with keyword search from lattice assumption.

DOI
10.1109/cc.2018.8357694

Related papers

Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model

Xiaojun Zhang, Chunxiang Xu, Run Xie +1 more

Recently, how to retrieve the encrypted data efficiently from a cloud storage system becomes a hot topic. Public key encryption with keyword search (PEKS) can allow one to search the encrypted data with a keyword efficiently. Due to the booming of post-quantum cryptography, we propose public key encryption with keyword search from lattice assumption, which can resist quantum computer attacks. We delegate a particular cloud server to search the results, thus only the designated cloud server can finish the test process. Our scheme has been proved ciphertext indistinguishability in the standard model, which can reflect its security in the real world. To the best of our knowledge, our scheme is the first construction based on lattice in the standard model, which is a step stone in the post-quantum cryptographic communication.

Chinese Journal of Electronics•Mar 1, 2018•12 citations

Lattice-based searchable public-key encryption scheme for secure cloud storage

Run Xie, Chunxiang Xu, Chanlian He +1 more

With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.

International Journal of Web and Grid Services•Dec 6, 2017•11 citations

Lattice-based searchable public-key encryption scheme for secure cloud storage

Chanlian He, Chunxiang Xu, Run Xie +1 more

With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.

International Journal of Web and Grid Services•Nov 13, 2017•2 citations

Public-key Authenticated Encryption with Keyword Search

Ziyuan Liu, Yi‐Fan Tseng, Raylin Tso +2 more

With the rapid development of cloud computing, an increasing number of companies are adopting cloud storage technology to reduce overhead. However, to ensure the privacy of sensitive data, the uploaded data need to be encrypted before being outsourced to the cloud. The concept of public-key encryption with keyword search (PEKS) was introduced by Boneh et al. to provide flexible usage of the encrypted data. Unfortunately, most of the PEKS schemes are not secure against inside keyword guessing attacks (IKGA), so the keyword information of the trapdoor may be leaked to the adversary. To solve this issue, Huang and Li presented public key authenticated encryption with keyword search (PAEKS) in which the trapdoor generated by the receiver is only valid for authenticated ciphertexts. With their seminal work, many PAEKS schemes have been introduced for the enhanced security of PAEKS. Some of them further consider the upcoming quantum attacks. However, our cryptanalysis indicated that in fact, these schemes could not withstand IKGA. To fight against the attacks from quantum adversaries and support the privacy-preserving search functionality, we first introduce a novel generic PAEKS construction in this work. Then, we further present the first quantum-resistant PAEKS instantiation based on lattices. The security proofs show that our instantiation not only satisfies the basic requirements but also achieves enhanced security models, namely the multi-ciphertext indistinguishability and multi-trapdoor privacy. Furthermore, the comparative results indicate that with only some additional expenditure, the proposed instantiation provides more secure properties, making it suitable for more diverse application environments.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•May 24, 2022•42 citations

Designated server-aided revocable identity-based keyword search on lattice

Ying Guo, Fei Meng, Leixiao Cheng +2 more

Abstract Public key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it’s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user’s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.

EURASIP Journal on Wireless Communications and Networking•Sep 6, 2021•2 citations

ML-CLEKS: Module Lattice Based Certificateless Encryption with Keyword Search in Cloud Storage

Guntuka Sudeep, P. Praveen Kumar, Satish Narayana Srirama

Public key encryption with keyword search (PEKS) is a method to search over encrypted data in the cloud. However, traditional PEKS schemes are based on classical mathematical problems, which are vulnerable to quantum attacks. To address the issues, several authors proposed lattice-based PEKS. Although lattice-based PEKS resist quantum attacks, they are inefficient and also suffer from certificate management problem (CMP) or key escrow problem (KEP). To address these issues, in this paper, we propose module lattice-based certificateless encryption with keyword search (ML-CLEKS) without trapdoor algorithms. The security of ML-CLEKS is proved against TYPE-I and TYPE-II adversaries based on Module Learning with Error (Module LWE) in random oracle model. Theoretical analysis and experimental results demonstrate that ML-CLEKS is efficient.

IEEE International Conference on Cloud Computing Technology and Science•Nov 14, 2025•0 citations
Public key encryption scheme with keyword search (PEKS) enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any information about the encrypted data without the trapdoor corresponding to the keyword. The PEKS is useful to keep the management of large data storages secure such as those in a cloud. In this paper, to protect against quantum computer attacks, we present a lattice-based identity-based encryption scheme with keyword search. We have proved that our scheme can achieve ciphertext indistinguishability in the random oracle model, and our scheme can also achieve trapdoor security. In particular, our scheme can designate a unique tester to test and return the search results, therefore it does not need a secure channel. To the best of our knowledge, our scheme is the first identity- based encryption scheme with keyword search from lattice assumption.
Recently, how to retrieve the encrypted data efficiently from a cloud storage system becomes a hot topic. Public key encryption with keyword search (PEKS) can allow one to search the encrypted data with a keyword efficiently. Due to the booming of post-quantum cryptography, we propose public key encryption with keyword search from lattice assumption, which can resist quantum computer attacks. We delegate a particular cloud server to search the results, thus only the designated cloud server can finish the test process. Our scheme has been proved ciphertext indistinguishability in the standard model, which can reflect its security in the real world. To the best of our knowledge, our scheme is the first construction based on lattice in the standard model, which is a step stone in the post-quantum cryptographic communication.
With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.
With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.
With the rapid development of cloud computing, an increasing number of companies are adopting cloud storage technology to reduce overhead. However, to ensure the privacy of sensitive data, the uploaded data need to be encrypted before being outsourced to the cloud. The concept of public-key encryption with keyword search (PEKS) was introduced by Boneh et al. to provide flexible usage of the encrypted data. Unfortunately, most of the PEKS schemes are not secure against inside keyword guessing attacks (IKGA), so the keyword information of the trapdoor may be leaked to the adversary. To solve this issue, Huang and Li presented public key authenticated encryption with keyword search (PAEKS) in which the trapdoor generated by the receiver is only valid for authenticated ciphertexts. With their seminal work, many PAEKS schemes have been introduced for the enhanced security of PAEKS. Some of them further consider the upcoming quantum attacks. However, our cryptanalysis indicated that in fact, these schemes could not withstand IKGA. To fight against the attacks from quantum adversaries and support the privacy-preserving search functionality, we first introduce a novel generic PAEKS construction in this work. Then, we further present the first quantum-resistant PAEKS instantiation based on lattices. The security proofs show that our instantiation not only satisfies the basic requirements but also achieves enhanced security models, namely the multi-ciphertext indistinguishability and multi-trapdoor privacy. Furthermore, the comparative results indicate that with only some additional expenditure, the proposed instantiation provides more secure properties, making it suitable for more diverse application environments.
Abstract Public key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it’s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user’s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.
Public key encryption with keyword search (PEKS) is a method to search over encrypted data in the cloud. However, traditional PEKS schemes are based on classical mathematical problems, which are vulnerable to quantum attacks. To address the issues, several authors proposed lattice-based PEKS. Although lattice-based PEKS resist quantum attacks, they are inefficient and also suffer from certificate management problem (CMP) or key escrow problem (KEP). To address these issues, in this paper, we propose module lattice-based certificateless encryption with keyword search (ML-CLEKS) without trapdoor algorithms. The security of ML-CLEKS is proved against TYPE-I and TYPE-II adversaries based on Module Learning with Error (Module LWE) in random oracle model. Theoretical analysis and experimental results demonstrate that ML-CLEKS is efficient.