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

Lecture notes in computer science

An Efficient Lattice-Based Encrypted Search Scheme with Forward Security

Xiaoling Yu, Lei Xu, Xin Huang, Chungen Xu

Published Jan 1, 2022• 3 citations
Publisher
DOI
10.1007/978-3-031-23020-2_40

Related papers

An Efficient Designated-Server Public-Key Encryption Scheme with Keyword Search Based on Lattices

Yuchen Zou, Hongbo Li, Pingbin Luo +1 more

Lecture notes in computer science•Oct 15, 2025•0 citations

Lattice-Based Forward Secure Certificateless Encryption Scheme for Cloud Data Management

Shiyuan Xu, Xue Chen, Yue Wang +4 more

Lecture notes in computer science•Jan 1, 2026•1 citation

Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from lattice

Xiaoling Yu, Chungen Xu, Lei Xu +1 more

Soft Computing•Sep 12, 2022•8 citations

FS-PEKS: Lattice-based Forward Secure Public-key Encryption with Keyword Search for Cloud-assisted Industrial Internet of Things

Xiaojun Zhang, Chunxiang Xu, Huaxiong Wang +2 more

Cloud-assisted Industrial Internet of Things (IIoT) relies on cloud computing to provide massive data storage services. To ensure the confidentiality, sensitive industrial data need to be encrypted before being outsourced to cloud storage server. Public-key encryption with keyword search (PEKS) enables users to search target encrypted data by keywords. However, most existing PEKS schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with quantum computers in the near future. Moreover, they suffer from key exposure, and thus the security would be broken once the keys are compromised. In this paper, we propose a forward secure PEKS scheme (FS-PEKS) based on lattice assumptions for cloud-assisted IIoT, which is post-quantum secure. We integrate a lattice-based delegation mechanism into FS-PEKS to achieve forward security, such that the security of the system is still guaranteed even the keys are compromised by the adversaries. We define the first formal security model on forward security of PEKS, and prove the security of FS-PEKS under the model. As the keywords of industrial data are with inherently low entropy, we further extend FS-PEKS to resist insider keyword guessing attacks (IKGA). The comprehensive performance evaluation demonstrates that FS-PEKS is practical for cloud-assisted IIoT.

IEEE Transactions on Dependable and Secure Computing•Jan 1, 2019•144 citations

A Novel Key Generation Algorithm Utilizing Lattice-Based Cryptography Principles

Rajakumar Arul, B. Sivaselvam, Ankush Choudhary

Lecture notes in networks and systems•Oct 21, 2024•0 citations

Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing Attacks

Qing Fan, Debiao He, Jianhua Chen +2 more

Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user’s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga’s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes’ security properties, communication cost, and computing overload among.

IEEE Systems Journal•Jul 1, 2022•10 citations
Cloud-assisted Industrial Internet of Things (IIoT) relies on cloud computing to provide massive data storage services. To ensure the confidentiality, sensitive industrial data need to be encrypted before being outsourced to cloud storage server. Public-key encryption with keyword search (PEKS) enables users to search target encrypted data by keywords. However, most existing PEKS schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with quantum computers in the near future. Moreover, they suffer from key exposure, and thus the security would be broken once the keys are compromised. In this paper, we propose a forward secure PEKS scheme (FS-PEKS) based on lattice assumptions for cloud-assisted IIoT, which is post-quantum secure. We integrate a lattice-based delegation mechanism into FS-PEKS to achieve forward security, such that the security of the system is still guaranteed even the keys are compromised by the adversaries. We define the first formal security model on forward security of PEKS, and prove the security of FS-PEKS under the model. As the keywords of industrial data are with inherently low entropy, we further extend FS-PEKS to resist insider keyword guessing attacks (IKGA). The comprehensive performance evaluation demonstrates that FS-PEKS is practical for cloud-assisted IIoT.
Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user’s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga’s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes’ security properties, communication cost, and computing overload among.