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

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

Shiyuan Xu, Xue Chen, Yue Wang, Tianrun Xu, Fangda Guo, Xiaoli Zhang, Siu‐Ming Yiu

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.1007/978-981-95-4155-3_31

Related papers

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

Juyan Li, Mingyan Yan, Jialiang Peng +2 more

Future Generation Computer Systems•Apr 21, 2024•15 citations

Lattice-Based Forward Secure and Certificateless Signature Scheme

Qian Xu, Chengxiang Tan, Jun Feng +2 more

Journal of Computer Research and Development•Jul 1, 2017•3 citations

Lattice-based certificateless encryption scheme

Mingming Jiang, Yupu Hu, Hao Chuan Lei +2 more

Frontiers of Computer Science•Jul 31, 2014•5 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

Certificateless Bilinear Quantum Mutual Exclusive Signcryption for Data Security in Cloud

Kavitha. K*, V. Saravanan

Signcryption perform both encryption and signature verification simultaneously with minimum computational time and overhead when compared to that of the traditional signature model. Certificateless Sigcryption rectifies issues corresponding to the key escrow problem and hence reducing the key management in the traditional key cryptography in Cloud environment. There has been some Certificateless Signcryption methods proposed, most of which are proved secured using the proxy pairing operations. However, with proxy pairing found to be computationally difficult in understanding and with the discrete operation reducing the advantages gained from smaller key size, data security is said to be compromised. To address this issue, in this work, a method called, Bilinear Quantum Mutual Exclusive Signcryption (BQ-MES) for data security in cloud environment is presented based on quantum principles. The new method inherits the security of bilinear mapping along with quantum, which possesses lower computation complexity than proxy operations, employed in signcrypting data in cloud environment. In the BQ-MES method, only a designated authorized cloud user recovers the data stored in the cloud via cloud service provider by verifying the validity of a signcrypted data. This is performed using Mutually Exclusive Probability model. Experimental works are conducted on the parameters such as computational time, computational overhead and data security rate. By evaluating the performance with related schemes, results show that the data stored in cloud environment is secured using BQ-MES method and computationally efficient.

International Journal of Innovative Technology and Exploring Engineering•Dec 30, 2019•0 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.
Signcryption perform both encryption and signature verification simultaneously with minimum computational time and overhead when compared to that of the traditional signature model. Certificateless Sigcryption rectifies issues corresponding to the key escrow problem and hence reducing the key management in the traditional key cryptography in Cloud environment. There has been some Certificateless Signcryption methods proposed, most of which are proved secured using the proxy pairing operations. However, with proxy pairing found to be computationally difficult in understanding and with the discrete operation reducing the advantages gained from smaller key size, data security is said to be compromised. To address this issue, in this work, a method called, Bilinear Quantum Mutual Exclusive Signcryption (BQ-MES) for data security in cloud environment is presented based on quantum principles. The new method inherits the security of bilinear mapping along with quantum, which possesses lower computation complexity than proxy operations, employed in signcrypting data in cloud environment. In the BQ-MES method, only a designated authorized cloud user recovers the data stored in the cloud via cloud service provider by verifying the validity of a signcrypted data. This is performed using Mutually Exclusive Probability model. Experimental works are conducted on the parameters such as computational time, computational overhead and data security rate. By evaluating the performance with related schemes, results show that the data stored in cloud environment is secured using BQ-MES method and computationally efficient.