Efficient identity-based multi-identity fully homomorphic encryption scheme

doi:10.11772/j.issn.1001-9081.2018081669

Journal of Computer Applications ›› 2019, Vol. 39 ›› Issue (3): 750-755.DOI: 10.11772/j.issn.1001-9081.2018081669

Previous Articles Next Articles

Efficient identity-based multi-identity fully homomorphic encryption scheme

TU Guangsheng^1,2, YANG Xiaoyuan^1,2, ZHOU Tanping^1,2

1. Key Laboratory of Network and Information Security of the Chinese People's Armed Police Force, Xi'an Shaanxi 710086, China;
2. College of Cryptographic Engineering, Engineering University of the Chinese People's Armed Police Force, Xi'an Shaanxi 710086, China

Received:2018-08-13 Revised:2018-10-23 Online:2019-03-10 Published:2019-03-11
Contact: 杨晓元
Supported by:
This work is partially supported by the National Key Research and Development Program of China (2017YFB0802000), the National Natural Science Foundation of China (U1636114, 61772550, 61572521), the National Cryptography Development Fund of China (MMJJ20170112).

高效的身份基多用户全同态加密方案

涂广升^1,2, 杨晓元^1,2, 周潭平^1,2

1. 网络和信息安全武警部队重点实验室, 西安 710086;
2. 武警工程大学密码工程学院, 西安 710086

作者简介:涂广升(1992-),男,河南驻马店人,硕士研究生,主要研究方向:信息安全、同态密码;杨晓元(1959-),男,湖南湘潭人,教授,博士生导师,硕士,主要研究方向:信息安全、密码学;周潭平(1989-),男,江西贵溪人,博士,主要研究方向:信息安全、同态密码。
基金资助:
国家重点研发计划项目（2017YFB0802000）；国家自然科学基金资助项目（U1636114，61772550，61572521）；国家密码发展基金资助项目（MMJJ20170112）。

Abstract

Abstract: Focusing on the issue that the traditional Identity-Based Fully Homomorphic Encryption scheme (IBFHE) cannot perform homomorphic operations on ciphertexts under different IDentities (ID), a hierarchical identity-based multi-identity fully homomorphic encryption scheme based on Learning With Error (LWE) problem was proposed. In the proposed scheme, the transformation mechanism of identity-based multi-identity homomorphic encryption scheme ([CM15] scheme) proposed by Clear et al. (CLEAR M, McGOLDRICK C. Multi-identity and multi-key leveled FHE from learning with errors. Proceedings of the 2015 Annual Cryptology Conference, LNCS 9216. Berlin:Springer, 2015:630-656) in 2015 was combined with Identity-Based Encryption (IBE) scheme proposed by Cash et al. (CASH D, HOFHEINZ D, KILTZ E, et al. Bonsai trees, or how to delegate a lattice basis. Proceedings of the 2010 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin:Springer, 2010:523-552) in 2010 ([CHKP10] scheme), guranteeing IND-ID-CPA (INDistinguishability of IDentity-based encryption under Chosen-Plaintext Attack) security in the random oracle model and realizing ciphertext homomorphic operation under different identities, so the application of this scheme was more promising. Compared with[CM15] scheme, the proposed scheme has advantages in terms of public key scale, private key scale, ciphertext size, and hierarchical properties, and has a wide application prospect.

Key words: hierarchical identity-based encryption, multi-identity, fully homomorphic encryption, homomorphic operation, Learning With Error (LWE)

摘要： 针对传统的身份基全同态加密（IBFHE）方案无法对不同身份标识（ID）下的密文进行同态运算的问题，提出一个基于误差学习（LWE）问题的分层身份基多用户全同态加密方案。该方案利用Clear等（CLEAR M，McGOLDRICK C.Multi-identity and multi-key leveled FHE from learning with errors.Proceedings of the 2015 Annual Cryptology Conference，LNCS 9216.Berlin：Springer，2015：630-656）在2015年提出的身份基多用户全同态加密方案（[CM15]方案）的转化机制，结合Cash等（CASH D，HOFHEINZ D，KILTZ E，et al.Bonsai trees，or how to delegate a lattice basis.Proceedings of the 2010 Annual International Conference on the Theory and Applications of Cryptographic Techniques，LNCS 6110.Berlin：Springer，2010：523-552）在2010年提出的身份基加密（IBE）方案（[CHKP10]方案），实现了不同身份标识下的密文同态运算，应用前景更加广阔，在随机预言机模型下为基于身份匿名的选择明文攻击下的不可区分性（IND-ID-CPA）安全。与[CM15]方案相比，该方案在公钥规模、私钥规模、密文尺寸、分层性质和密钥更新周期方面都具有优势。

关键词: 分层身份基加密, 多用户, 全同态加密, 同态运算, 基于误差学习

CLC Number:

TP309

TU Guangsheng, YANG Xiaoyuan, ZHOU Tanping. Efficient identity-based multi-identity fully homomorphic encryption scheme[J]. Journal of Computer Applications, 2019, 39(3): 750-755.

涂广升, 杨晓元, 周潭平. 高效的身份基多用户全同态加密方案[J]. 计算机应用, 2019, 39(3): 750-755.

References

[1] GENTRY C. Fully homomorphic encryption using ideal lattices[C]//STOC 2009:Proceedings of the 41st Annual ACM Symposium on Symposium on Theory of Computing. New York:ACM, 2009:169-178.
[2] GENTRY C, HALEVI S. Implementing Gentry's fully-homomorphic encryption scheme[C]//EUROCRYPT 2011:Proceedings of the 2011 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6632. Berlin:Springer, 2011:129-148.
[3] BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. (Leveled) fully homomorphic encryption without bootstrapping[C]//ITCS'12:Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. New York:ACM, 2012:309-325.
[4] GENTRY C, SAHAI A, WATERS B. Homomorphic encryption from learning with errors:conceptually-simpler, asymptotically-faster, attribute-based[C]//CRYPTO 2013:Proceedings of the 2013 Advances in Cryptology, LNCS 8042. Berlin:Springer, 2013:75-92.
[5] 陈智罡.基于格的全同态加密研究与设计[D].南京:南京航空航天大学,2015:23.(CHEN Z G. Research and dedign of fully homomorphic encryption based on lattice[D]. Nanjing:Nanjing University of Aeronautics and Astronautics, 2015:23.)
[6] CLEAR M, McGOLDRICK C. Multi-identity and multi-key leveled FHE from learning with errors[C]//Proceedings of the 2015 Annual Cryptology Conference, LNCS 9216. Berlin:Springer, 2015:630-656.
[7] CASH D, HOFHEINZ D, KILTZ E, et al. Bonsai trees, or how to delegate a lattice basis[C]//Proceedings of the 2010 Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin:Springer, 2010:523-552.
[8] GENTRY C, PEIKERT C, VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic constructions[C]//STOC'08:Proceedings of the 40th Annual ACM Symposium on Theory of Computing. New York:ACM, 2008:197-206.
[9] 李增鹏,马春光,周红生.全同态加密研究[J].密码学报, 2017,4(6):561-578.(LI Z P, MA C G, ZHOU H S. Overview on fully homomorphic encryption[J]. Journal of Cryptologic Research, 2017, 4(6):561-578.)
[10] MICCIANCIO D. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions[J]. Computational Complexity, 2007, 16(4):365-411.
[11] BONEH D, FRANKLIN M. Identity-based encryption from the Weil pairing[C]//Proceedings of the 2001 Annual International Cryptology Conference, LNCS 2139. Berlin:Springer, 2001:213-229.
[12] SHAMIR A. Identity-based cryptosystems and signature schemes[C]//Proceedings of the 1984 Workshop on the Theory and Application of Cryptographic Techniques, LNCS 196. Berlin:Springer, 1984:47-53.
[13] REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]//Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York:ACM, 2005:84-93.
[14] PEIKERT C. Public-key cryptosystems from the worst-case shortest vector problem:extended abstract[C]//STOC'09:Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:333-342.
[15] REGEV O. The learning with errors problem (invited survey)[C]//Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity. Piscataway, NJ:IEEE, 2010:191-204.
[16] 周潭平.基于GLWE问题的密码体制研究与设计[D].西安:武警工程大学,2014:13.(ZHOU T P. Research and design of cryptosystem based on GLWE problem[D]. Xi'an:Engineering University of the Chinese People's Armed Police Force, 2014:13.)
[17] 石悦,李相龙,戴方芳.一种基于属性基加密的增强型软件定义网络安全框架[J].信息网络安全,2018(1):15-22.(SHI Y, LI X L, DAI F F. An enhanced security framework of software defined network based on attribute-based encryption[J]. Netinfo Security, 2018(1):15-22.)

Efficient identity-based multi-identity fully homomorphic encryption scheme

高效的身份基多用户全同态加密方案

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 10

Recommended Articles

Metrics

[1]	ZHANG En, HOU Yingying, LI Gongli, LI Huimin, LI Yu. Adaptive hierarchical searchable encryption scheme based on learning with errors [J]. Journal of Computer Applications, 2020, 40(1): 148-156.
[2]	YU Qingfei, TU Guangsheng, LI Ningbo, ZHOU Tanping. Multi-hop multi-policy attributed-based fully homomorphic encryption scheme [J]. Journal of Computer Applications, 2019, 39(8): 2326-2332.
[3]	BAI Ping, ZHANG Wei. Fully homomorphic encryption scheme based on learning with errors under multi-attribute environment [J]. Journal of Computer Applications, 2018, 38(5): 1377-1382.
[4]	LI Mingxiang, LIU Zhao, ZHANG Mingyan. Fully homomorphic encryption scheme without Gaussian noise [J]. Journal of Computer Applications, 2017, 37(12): 3430-3434.
[5]	DAI Xiaoming, ZHANG Wei, ZHENG Zhiheng, LI Zhenlin. GSW-type hierarchical identity-based fully homomorphic encryption scheme from learning with errors [J]. Journal of Computer Applications, 2016, 36(7): 1856-1860.
[6]	HUANG Wenzhen, YANG Xiaoyuan, WANG Xu'an, WU Liqiang. Identity-based broadcast encryption based on lattice [J]. Journal of Computer Applications, 2016, 36(4): 956-961.
[7]	WANG Zhao, DING Yong, WANG Huiyong. Leveled fully homomorphic encryption scheme based on Ring-LWE-GSW [J]. Journal of Computer Applications, 2016, 36(4): 962-965.
[8]	XIANG Wen, YANG Xiaoyuan, WU Liqiang. Revocable fuzzy identity based encryption scheme over ideal lattice [J]. Journal of Computer Applications, 2016, 36(10): 2733-2737.
[9]	WANG Zhanjun, MA Haiying, WANG Jinhua. Fully secure hierarchical identity-based online/offline encryption [J]. Journal of Computer Applications, 2015, 35(9): 2522-2526.
[10]	LI Shaokun. Provable secure certificateless fully homomorphic encryption scheme in standard model [J]. Journal of Computer Applications, 2015, 35(2): 387-392.