Lattice-based certificateless encryption scheme  

作　　者：Mingming JIANG Yupu HU Hao LEI Baocang WANG Qiqi LAI 

机构地区：[1]State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China [2]Security and Privacy Lab, CRDU, Huawei Technologies Co., LTD., Beijing 100095, China

出　　处：《Frontiers of Computer Science》2014年第5期828-836,共9页中国计算机科学前沿（英文版）

基　　金：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.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.

关 键 词：lattice-based cryptography LWE identity-based encryption （IBE） post-quantum cryptography certifi-cateless encryption 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP311.52[自动化与计算机技术—计算机科学与技术]