Certificateless Public Key Encryption Scheme with Hybrid Problems and Its Application to Internet of Things

Rui Guo,Hua Zhang,Qiaoyan Wen,Zhengping Jin,Huixian Shi

doi:10.1155/2014/980274

Abstract

Certificateless cryptography aims at combining the advantages of public key cryptography and identity based cryptography to avoid the certificate management and the key escrow problem. In this paper, we present a novel certificateless public key encryption scheme on the elliptic curve over the ring, whose security is based on the hardness assumption of Bilinear Diffie-Hellman problem and factoring the large number as in an RSA protocol. Moreover, since our scheme requires only one pairing operation in decryption, it is significantly more efficient than other related schemes. In addition, based on our encryption system, we also propose a protocol to protect the confidentiality and integrity of information in the scenario of Internet of Things with constrained resource nodes.

Highlights

In a traditional public key cryptography (PKC) scheme, public key certificates signed by a certificate authority (CA) are employed to ensure the authenticity of public keys
We present a novel certificateless public key encryption scheme on the elliptic curve over the ring, whose security is based on the hardness assumption of Bilinear Diffie-Hellman problem and factoring the large number as in an RSA protocol
To simplify the complex certificate management process, Shamir proposed the concept of identity-based public key cryptography (ID-PKC) [1], where an entity is allowed to use his identity such as email and IP address as his public key

Summary

Introduction

In a traditional public key cryptography (PKC) scheme, public key certificates signed by a certificate authority (CA) are employed to ensure the authenticity of public keys. Sun and Li [7] proposed a short-ciphertext CCA2 secure certificateless encryption scheme under the standard bilinear Diffie-Hellman assumption. We employ use of the bilinear pairing to design a certificateless encryption scheme on the elliptic curves over the ring Zn [12, 13], which overcomes the security defect of the Koyama et al.’s scheme [14] whose security is only based on the problem of factoring the large number as in RSA.

Elliptic Curve over the Ring

Our CL-PKE Scheme

Application to Internet of Things

Conclusion