Certificateless public key cryptography （CL- PKC） can solve the problems of certificate management in a public key infrastructure （PKI） and of key escrows in identity-based public key cryptography （ID-PKC）. In C...Certificateless public key cryptography （CL- PKC） can solve the problems of certificate management in a public key infrastructure （PKI） and of key escrows in identity-based public key cryptography （ID-PKC）. In CL- PKC, the key generation center （KGC） does not know the private keys of all users, and their public keys need not be cer- tificated by certification authority （CA）. At present, however, most certificateless encryption schemes are based on large in- teger factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate- less encryption scheme based on lattices, more precisely, us- ing the hardness of the learning with errors （LWE） problem. Compared with schemes based on large integer factoriza- tion and discrete logarithms, the most operations are matrix- vector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks （IND-CPA） secure in the random oracle model.展开更多
基金This work was supported by the National Natural Science Foundations of China （Grant Nos. 61173151, 61173152 and 61100229） and Huawei Technologies Co., Ltd., （YBCB2011116）.
文摘Certificateless public key cryptography （CL- PKC） can solve the problems of certificate management in a public key infrastructure （PKI） and of key escrows in identity-based public key cryptography （ID-PKC）. In CL- PKC, the key generation center （KGC） does not know the private keys of all users, and their public keys need not be cer- tificated by certification authority （CA）. At present, however, most certificateless encryption schemes are based on large in- teger factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate- less encryption scheme based on lattices, more precisely, us- ing the hardness of the learning with errors （LWE） problem. Compared with schemes based on large integer factoriza- tion and discrete logarithms, the most operations are matrix- vector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks （IND-CPA） secure in the random oracle model.
