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

Future Generation Computer Systems

A lattice-based efficient certificateless public key encryption for big data security in clouds

Juyan Li, Mingyan Yan, Jialiang Peng, Haodong Huang, Ahmed A. Abd El‐Latif

Published Apr 21, 2024• 15 citations
Publisher
DOI
10.1016/j.future.2024.04.039

Related papers

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

Lattice-based certificateless public-key encryption in the standard model

Reza Sepahi, Ron Steinfeld, Josef Pieprzyk

International Journal of Information Security•Dec 9, 2013•13 citations

A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model

Dung Hoang Duong, Willy Susilo, Minh Kim Bui +1 more

Lecture notes in computer science•Jan 1, 2020•12 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

Lattice-Based Revocable Certificateless Public Key Encryption for Team Score Orienteering

You Jun Zhao, Mingyan Yan, Kaien Yan +1 more

Team score orienteering, a challenging and interesting sport, is gradually becoming known by the majority of sports enthusiasts. Integrating team score orienteering with the Internet can enhance the interactive experience for athletes. However, this integration increases the risk of the leakage of the athletes’ information. In order to protect the privacy of athletes, it is necessary to employ encryption. Therefore, this paper proposes an efficient lattice-based revocable certificateless public key encryption (RCL-PKE) scheme with decryption key exposure resistance (DKER). The adoption of certificateless encryption not only avoids the complex certificate management required for traditional public key encryption, but also addresses the key escrow problem of identity-based encryption, thereby significantly ensuring data security and privacy. Furthermore, the revocable mechanism enables the organizing committee to flexibly manage the athletes’ qualification for competitions, and DKER can effectively prevent the leakage of decryption keys, which further enhances data security. The constructed RCL-PKE scheme was proven to be IND-CPA secure under the learning with errors (LWE) assumption. Experiments indicated that the proposed RCL-PKE scheme had lower computation and communication costs, making it particularly suitable for team score orienteering.

Mathematics•May 30, 2024•2 citations

Efficient iNTRU-based public key authentication keyword searchable encryption in cloud computing

Yunfei Yao, Huiyan Chen, Ke Wang +3 more

With the popularity of cloud computing, a large number of personal and corporate data are outsourced to the cloud. This centralized storage and processing mode not only improves the efficiency of data processing, but also brings challenges to data security and privacy. In view of the development of quantum computing, the traditional public key encryption may no longer be secure in the future. Therefore, it is particularly important to study the public key authenticated keyword searchable encryption (PEAKS) scheme which can resist quantum. This scheme can provide double guarantee for the data in cloud storage: one is to ensure the confidentiality of the data, so that the original content cannot be decrypted even within the cloud service provider; the other is to allow users to perform keyword searches on encrypted data without decrypting the data. This provides a balance of security and efficiency for data search and analysis in cloud computing environment. Recently, Genise et al. designed a Gadget-based iNTRU trapdoor, which has the advantages of small size and high efficiency. Therefore, we design an efficient and secure public key authentication keyword searchable encryption scheme based on iNTRU lattice. The overall running time of this scheme is only more than 300ms.

Journal of Systems Architecture•Jul 11, 2024•9 citations
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.
Team score orienteering, a challenging and interesting sport, is gradually becoming known by the majority of sports enthusiasts. Integrating team score orienteering with the Internet can enhance the interactive experience for athletes. However, this integration increases the risk of the leakage of the athletes’ information. In order to protect the privacy of athletes, it is necessary to employ encryption. Therefore, this paper proposes an efficient lattice-based revocable certificateless public key encryption (RCL-PKE) scheme with decryption key exposure resistance (DKER). The adoption of certificateless encryption not only avoids the complex certificate management required for traditional public key encryption, but also addresses the key escrow problem of identity-based encryption, thereby significantly ensuring data security and privacy. Furthermore, the revocable mechanism enables the organizing committee to flexibly manage the athletes’ qualification for competitions, and DKER can effectively prevent the leakage of decryption keys, which further enhances data security. The constructed RCL-PKE scheme was proven to be IND-CPA secure under the learning with errors (LWE) assumption. Experiments indicated that the proposed RCL-PKE scheme had lower computation and communication costs, making it particularly suitable for team score orienteering.
With the popularity of cloud computing, a large number of personal and corporate data are outsourced to the cloud. This centralized storage and processing mode not only improves the efficiency of data processing, but also brings challenges to data security and privacy. In view of the development of quantum computing, the traditional public key encryption may no longer be secure in the future. Therefore, it is particularly important to study the public key authenticated keyword searchable encryption (PEAKS) scheme which can resist quantum. This scheme can provide double guarantee for the data in cloud storage: one is to ensure the confidentiality of the data, so that the original content cannot be decrypted even within the cloud service provider; the other is to allow users to perform keyword searches on encrypted data without decrypting the data. This provides a balance of security and efficiency for data search and analysis in cloud computing environment. Recently, Genise et al. designed a Gadget-based iNTRU trapdoor, which has the advantages of small size and high efficiency. Therefore, we design an efficient and secure public key authentication keyword searchable encryption scheme based on iNTRU lattice. The overall running time of this scheme is only more than 300ms.