Novel identity-based fully homomorphic encryption scheme from lattice

被引：0

作者：

Tang Y.-L. ^{[1
]}

Hu M.-X. ^{[1
]}

Liu K. ^{[1
]}

Ye Q. ^{[1
]}

Yan X.-X. ^{[1
]}

机构：

[1] College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo

来源：

Tongxin Xuebao/Journal on Communications | 2017年 / 38卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Cryptography; Fully homomorphic encryption; Identity-based encryption; Lattice; Standard model;

D O I：

10.11959/j.issn.1000-436x.2017098

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

The previous identity-based homomorphic encryption schemes from lattice was analyzed. That the high complexity in previous schemes was mainly caused by trapdoor generation and preimage sampling was pointed out. A new solution was proposed. A novel identity-based encryption scheme from lattice by combining new trapdoor function and dual-LWE algorithm organically was constructed, and it was transformed to an identity-based fully homomorphic encryption scheme from lattice by employing the idea of eigenvector. Comparative analysis shows that the scheme's complexity of trapdoor generation has a significant reduction, the complexity of preimage sampling has a nearly three-fold reduction, and the SIVP approximation factor has a √m times reduction. The security of the proposed scheme strictly reduces to the hardness of decisional learning with errors problem in the standard model. © 2017, Editorial Board of Journal on Communications. All right reserved.

引用

页码：39 / 47

页数：8

共 21 条

[1]

Rivest R., Adleman L., Dertouzos M., On data banks and privacy homomorphisms, IEEE 17nd Annual Symposium on Foundations of Computer Science (FOCS1978), pp. 169-177, (1978)

[2]

Gentry C., Fully homomorphic encryption using ideal lattices, The 41rd ACM Symposium on Theory of Computing (STOC2009), pp. 169-178, (2009)

[3]

Ducas L., Micciancio D., Bootstrapping homomorphic encryption in less than a second, Advances in Cryptology EUROCRYPT 2016, pp. 617-640, (2015)

[4]

Brakerski Z., Perlman R., Lattice-based fully dynamic multi-key FHE with short ciphertexts, Advances in Cryptology CRYPTO 2016, pp. 190-213, (2016)

[5]

Nuida K., Kurosawa K., (Batch) Fully homomorphic encryption over integers for non-binary message spaces, Advances in Cryptology EUROCRYPT 2015, pp. 537-555, (2015)

[6]

Guang Y., Zhu Y.F., Fei J.L., Et al., Identity-based fully homomorphic encryption from learning with error problem, Journal on Communications, 35, 2, pp. 111-117, (2014)

[7]

Kang Y.J., Gu C.X., Zheng Y.H., Et al., Identity-based fully homomorphic encryption from eigenvector, Journal of Software, 27, 6, pp. 1487-1497, (2016)

[8]

Gentry C., Sahai A., Waters B., Homomorphic encryption from learning with errors. Conceptually-simpler, asymptotically-faster, attribute-based, Advances in Cryptology CRYPTO 2013, pp. 75-92, (2013)

[9]

Clear M., McGoldrick C., Multi-identity and multi-key leveled FHE from learning with errors, Advances in Cryptology CRYPTO 2015, pp. 630-656, (2015)

[10]

Gentry C., Peikert C., Vaikuntanathan V., Trapdoors for hard lattices and new cryptographic constructions, The 40th ACM Symposium on Theory of Computing(STOC2008), pp. 197-206, (2008)

← 1 2 3 →