Efficient Certificateless Public Key Encryption Research Articles

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

With the advancement of technology and the development of digitization, big data has become an integral component of modern society. Due to the huge volume of big data, users generally upload data to the cloud for storage and computation. Because data in the cloud is beyond the control of users, it faces threats such as data security and personal privacy leakage. To address these concerns and achieve big data security and privacy protection in clouds, data encryption is crucial. Traditional public key encryption involves complex certificate management in a public key infrastructure (PKI). Although the identity-based encryption (IBE) scheme avoids the management of public key certificates, it has issues with key escrows and identity revocation. The certificateless public key encryption (CL-PKE) not only solves the key escrows problem in IBE, but also maintains its advantage of not requiring the use of certificate in PKI, making it suitable for the security protection of big data in clouds. However, most CL-PKE schemes are constructed based on large integer factorization and discrete logarithm problems, which cannot resist quantum computing attacks. Therefore, this paper proposes an efficient lattice-based CL-PKE scheme for big data security in clouds. In addition, the proposed scheme is extended to a lattice-based certificateless proxy re-encryption scheme, facilitating secure big data sharing in clouds. The proposed CL-PKE scheme can resist attacks from both internal and external adversaries, and has been proven to be IND-CPA secure under the learning with errors (LWE) assumption. Experiments have shown that the proposed CL-PKE scheme has lower computational and communication costs. The proposed lattice-based schemes can effectively provide post quantum security for the security and privacy protection of big data in clouds.

An efficient certificateless public key encryption scheme with authorized equality test in healthcare environments

The challenges confronting the privacy of outsourcing medical data have become a significant concern for patients and healthcare providers. The encryption of this sensitive data before outsourcing to the healthcare server present an effective solution for protection. However, searching on different ciphertexts while protecting the privacy of data remains a research challenge. Indeed, most of the existing schemes are inefficient, particularly for deployment on mobile devices due to limited resources (e.g. computing power, battery lifetime, and storage capacity). In this paper, we propose a CertificateLess Public-Key Encryption with Authorized Equality Test (CLPKE-AET) scheme. With the CLPKE-AET scheme, an authorized cloud server is permitted to check the equivalence of two different ciphertexts consisting of the same messages. Moreover, We provide four types of authorizations, base on which an authorized user can directly search on different user’s ciphertext using different methods while enhancing the privacy of the user’s data. We present our construction from bilinear pairing and demonstrate its security under modified Bilinear Diffie-Hellman (mBDHI) assumption in the Random Oracle Model (ROM). Finally, compared with other’s similar schemes, the performance analysis shows that our CLPKE-AET scheme is practical and more suitable for healthcare environments.

An efficient certificateless public key encryption with equality test toward Internet of Vehicles

AbstractWith the rapid development of the Internet of Vehicles, a great amount of vehicles are connected to Internet of Vehicles environment. These vehicles can exchange data to each other and upload the data to a cloud server for backup. Since the data contains some sensitive information, it is necessary to encrypt the data before uploading to the cloud server. However, this method severely hampers the utilization of data because of the tremendous difficulty in the search for encrypted data. For addressing the above issue, we propose a novel certificateless public key encryption supporting the equality test on ciphertexts that are performed by the cloud server while revealing nothing about the corresponding plaintexts. Our scheme has proved to be secure in bilinear Diffie‐Hellman assumption under the model of random oracle. At the same time, both theoretical analysis and experimental evaluation indicate the security, efficiency, as well as effectiveness of the proposed scheme.

Certificateless searchable public key encryption scheme for mobile healthcare system

As mobile communication technology develops, mobile healthcare system (MHS) is becoming a hot topic in academia and healthcare industry. MHS refers to providing medical services through mobile communication equipments. However, it faces many challenges, such as the finite storage, computing power and communication capabilities of MHS devices. To address this problem, the concept of cloud-based MHS has been proposed recently. Meanwhile, healthcare data outsourcing to cloud raises privacy and confidentiality concerns. In order to protect data security, we present an efficient certificateless public key encryption with keyword search (CLPEKS). Security analysis indicates that our scheme is secure resist chosen keyword and keyword guessing attacks in random oracle model. The computation costs of KeyGen, CLPEKS, Trapdoor and Test phases decreased by 84.68%, 55.04%, 36.1% and 28.73%, respectively, compared with Peng et al.’s scheme.

An Efficient and Provably-Secure Certificateless Public Key Encryption Scheme for Telecare Medicine Information Systems

Telecare Medicine Information Systems (TMIS) promote the traditional medical and healthcare services by information and communication technology. Since the physician and caregiver can monitor the patient's physiological condition remotely in TMIS, the confidentiality of this sensitive data should be protected, which is the key issue in the Health Insurance Portability and Accountability Act. In this paper, we propose an efficient certificateless public key encryption scheme without bilinear pairing for TMIS. Our proposal is proved to be secure in the random oracle model under the hardness assumption of computational Diffie-Hellman problem. Moreover, after modifying the original model of the certificateless encryption, this scheme achieves Girault's trust level 3. Compared with the related protocols, the perform evaluations show that our scheme is more efficient and appropriate to collocate with low power mobile devices for TMIS.

A new certificateless public key encryption scheme

Certificateless public key cryptography (CL-PKC) enjoys the advantage of identity based cryptography without suffering from its inherent key escrow problem. In this paper, a new efficient certificateless public key encryption scheme is proposed and its security can reach chosen-ciphertext (CCA2) secure in the random oracle model assuming the CDH and p-BDHI problem are difficult. A comparison shows that the efficiency of the proposed scheme is better than all known paring-based certificateless public key encryption schemes in the random oracle model.

Constructing Efficient Certificateless Public Key Encryption with Pairing

Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic series construction model of certificateless public key encryption (CL-PKE). However, this model pays much attention on the generic construction and neglects the properties of the pairings. In this paper we propose a CL-PKE scheme which is based on the nice algebraic properties of the pairing. The scheme breaks through the old series model and works in an efficient parallel model. Our scheme is more efficient on computation and has more compact ciphertext than the existing schemes.