Strongly Secure Certificate-Based Encryption Scheme with Low Communication Bandwidth

E-mail has been an important application to transfer the data of communication on Internet.In order to securely and efficiently transfer the E-mail message,many researchers focus on the issues of providing basic encryption function for E-mail protocol or certified E-mail schemes.However,these schemes only meet part of the security requirements for a secure E-mail protocol,and fail to provide a complete solution from the view of a practical secure E-mail protocol.A secure E-mail protocol is defined and proposed for the first time in this paper.In this protocol,the message is encrypted by the short-term encryption keys which are negotiated by the Diffie-Hellman algorithm.The security analysis shows that the scheme not only provides the basic security mechanism but also guarantees the perfect forward secrecy.In addition,this protocol resolves the problems of certification,timeliness and sensitivity,which are strongly needed by a secure E-mail protocol.E-mail has been an important application to transfer the data of communication on Internet.In order to securely and efficiently transfer the E-mail message,many researchers focus on the issues of providing basic encryption function for E-mail protocol or certified E-mail schemes.However,these schemes only meet part of the security requirements for a secure E-mail protocol,and fail to provide a complete solution from the view of a practical secure E-mail protocol.A secure E-mail protocol is defined and proposed for the first time in this paper.In this protocol,the message is encrypted by the short-term encryption keys which are negotiated by the Diffie-Hellman algorithm.The security analysis shows that the scheme not only provides the basic security mechanism but also guarantees the perfect forward secrecy.In addition,this protocol resolves the problems of certification,timeliness and sensitivity,which are strongly needed by a secure E-mail protocol.

Dianzi xuebaoJan 1, 20091 citation

Provably secure certificate-based encryption with leakage resilience

Yuyan Guo, Jiguo Li, Yang Lu +2 more

Theoretical Computer ScienceDec 12, 201736 citations

Enhancing WSN Data Security Using a Randomized Asymmetric Certificateless Arbitrated Quantum Signature Scheme

Ahmed M. Khedr, S. Sheeja Rani, Abo Bakr A. Khedr

Wireless Sensor Networks (WSNs), consisting of spatially distributed sensor nodes (SNs) that collect and transmit data to a base station, often operate in environments where secure communication is critical. Classical cryptographic techniques, while effective, frequently struggle to balance strong confidentiality with low latency, leading to vulnerabilities and inefficiencies. To overcome these challenges, this paper proposes the Randomized Asymmetric Certificate-less Arbitrated Quantum Signature (RACAQS) model, a novel quantum-assisted security framework for WSNs. The model integrates the McEliece Certificate-less cryptographic scheme with Arbitrated Quantum Signature mechanisms, ensuring robust confidentiality, integrity, and authenticity of transmitted data. RACAQS operates through three core phases: key pair generation, arbitrated quantum signcryption, and arbitrated quantum unsigncryption. Through these processes, SNs achieve secure key distribution, quantum-based encryption, and reliable verification with minimal overhead. Simulation results demonstrate that RACAQS achieves up to 4% higher confidentiality, integrity, and packet delivery ratio, and a 14% reduction in computation overhead, compared with existing schemes.Wireless Sensor Networks (WSNs), consisting of spatially distributed sensor nodes (SNs) that collect and transmit data to a base station, often operate in environments where secure communication is critical. Classical cryptographic techniques, while effective, frequently struggle to balance strong confidentiality with low latency, leading to vulnerabilities and inefficiencies. To overcome these challenges, this paper proposes the Randomized Asymmetric Certificate-less Arbitrated Quantum Signature (RACAQS) model, a novel quantum-assisted security framework for WSNs. The model integrates the McEliece Certificate-less cryptographic scheme with Arbitrated Quantum Signature mechanisms, ensuring robust confidentiality, integrity, and authenticity of transmitted data. RACAQS operates through three core phases: key pair generation, arbitrated quantum signcryption, and arbitrated quantum unsigncryption. Through these processes, SNs achieve secure key distribution, quantum-based encryption, and reliable verification with minimal overhead. Simulation results demonstrate that RACAQS achieves up to 4% higher confidentiality, integrity, and packet delivery ratio, and a 14% reduction in computation overhead, compared with existing schemes.

IEEE Sensors JournalFeb 24, 20260 citations

Certificate-based encryption resilient to key leakage

Qihong Yu, Jiguo Li, Yichen Zhang +3 more

Journal of Systems and SoftwareJun 23, 201551 citations

Lwe-Based Single Noisy Linear Equations for Public Key Over Integer Encryption

Mostefa Kara, Ahcène Bounceur, Abdelkader Laouid +3 more

In this work, we introduce a novel post-quantum public key encryption scheme over integers, leveraging a hybrid approach that combines large random numbers with the Learning With Errors (LWE) system. The scheme addresses the security challenges posed by quantum computing advancements, aiming to provide a robust solution resistant to quantum-based attacks. By using the unknown random number hardness assumption with enhancements to the traditional LWE framework and operating directly on integers, this approach ensures a high level of cryptographic security while maintaining computational efficiency. Extensive theoretical and experimental analyses demonstrate that the proposed encryption system achieves state-of-the-art performance: encryption execution time as low as $2.45 \times 10^{-5}$ seconds, decryption time of $4.47 \times 10^{-5}$ seconds, and an integrity check time of $5.30 \times 10^{-5}$ seconds. Moreover, the ciphertext size is reduced to only 1330 bits while maintaining a 256 -bit security level, representing a significant reduction in storage requirements compared to conventional lattice-based approaches. These results confirm that our scheme not only provides strong quantum-resistant security guarantees but also delivers excellent efficiency and scalability, making it a viable candidate for secure communications in bandwidth-limited and resource-constrained environments in the quantum era.In this work, we introduce a novel post-quantum public key encryption scheme over integers, leveraging a hybrid approach that combines large random numbers with the Learning With Errors (LWE) system. The scheme addresses the security challenges posed by quantum computing advancements, aiming to provide a robust solution resistant to quantum-based attacks. By using the unknown random number hardness assumption with enhancements to the traditional LWE framework and operating directly on integers, this approach ensures a high level of cryptographic security while maintaining computational efficiency. Extensive theoretical and experimental analyses demonstrate that the proposed encryption system achieves state-of-the-art performance: encryption execution time as low as$2.45 \times 10^{-5}$seconds, decryption time of$4.47 \times 10^{-5}$seconds, and an integrity check time of$5.30 \times 10^{-5}$seconds. Moreover, the ciphertext size is reduced to only 1330 bits while maintaining a 256 -bit security level, representing a significant reduction in storage requirements compared to conventional lattice-based approaches. These results confirm that our scheme not only provides strong quantum-resistant security guarantees but also delivers excellent efficiency and scalability, making it a viable candidate for secure communications in bandwidth-limited and resource-constrained environments in the quantum era.

IEEE PES Conference on Innovative Smart Grid Technologies - Middle East (ISGT Middle East)Nov 23, 20250 citations

Provably secure certificateless deniable authenticated encryption scheme

Jayaprakash Kar

Journal of Information Security and ApplicationsAug 5, 20209 citations

2.45 \times 10^{-5}

seconds, decryption time of

4.47 \times 10^{-5}

seconds, and an integrity check time of

5.30 \times 10^{-5}

seconds. Moreover, the ciphertext size is reduced to only 1330 bits while maintaining a 256 -bit security level, representing a significant reduction in storage requirements compared to conventional lattice-based approaches. These results confirm that our scheme not only provides strong quantum-resistant security guarantees but also delivers excellent efficiency and scalability, making it a viable candidate for secure communications in bandwidth-limited and resource-constrained environments in the quantum era.