Fully homomorphic encryption scheme without Gaussian noise

doi:10.11772/j.issn.1001-9081.2017.12.3430

Journal of Computer Applications ›› 2017, Vol. 37 ›› Issue (12): 3430-3434.DOI: 10.11772/j.issn.1001-9081.2017.12.3430

Previous Articles Next Articles

Fully homomorphic encryption scheme without Gaussian noise

LI Mingxiang^1,2, LIU Zhao^1,3, ZHANG Mingyan^1,3

1. Institute of Finance, Hebei Finance University, Baoding Hebei 071051, China;
2. Science and Technology Finance Key Laboratory of Hebei Province, Baoding Hebei 071051, China;
3. Financial Synergy Innovation of Science and Technology Center in Hebei Province, Baoding Hebei 071051, China

Received:2017-06-23 Revised:2017-08-27 Online:2017-12-10 Published:2017-12-18
Supported by:
This work is partially supported by the Key Research and Development Program of Hebei Province (16210701), the Scientific and Technological Research Project of Higher Education of Hebei Province (ZD2017228).

无高斯噪声的全同态加密方案

李明祥^1,2, 刘照^1,3, 张明艳^1,3

1. 河北金融学院金融研究所, 河北保定 071051;
2. 河北省科技金融重点实验室, 河北保定 071051;
3. 河北省科技金融协同创新中心, 河北保定 071051

通讯作者: 李明祥
作者简介:李明祥(1968-),男,山东济宁人,副教授,博士,主要研究方向:全同态加密方案;刘照(1989-),女,河北保定人,助教,硕士,主要研究方向:云计算安全;张明艳(1983-),女,湖北荆州人,副研究员,硕士,主要研究方向:互联网金融。
基金资助:
河北省重点研发计划项目（16210701）；河北省高等学校科学技术研究项目（ZD2017228）。

Abstract

Abstract: Much lately, a leveled fully homomorphic encryption scheme was proposed based on the Learning With Rounding (LWR) problem. The LWR problem is a variant of the Learning With Errors (LWE) problem, but it dispenses with the costly Gaussian noise sampling. Thus, compared with the existing LWE-based fully homomorphic encryption schemes, the proposed LWR-based fully homomorphic encryption scheme has much higher efficiency. But then, the user's evaluation key was needed to be obtained in the homomorphic evaluator of the proposed LWR-based fully homomorphic encryption scheme. Accordingly, a new leveled fully homomorphic encryption scheme was constructed based on the LWR problem, and the user's evaluation key was not needed to be obtained in the homomorphic evaluator of the new fully homomorphic encryption scheme. Since the new proposed fully homomorphic encryption scheme can be used to construct the schemes such as identity-based fully homomorphic encryption schemes, and attribute-based fully homomorphic encryption schemes, the new proposed scheme has wider application than the lately proposed LWR-based fully homomorphic encryption scheme.

Key words: Fully Homomorphic Encryption (FHE), leveled Fully Homomorphic Encryption (FHE), Learning With Rounding (LWR) problem, Learning With Errors (LWE) problem, Gaussian noise sampling

摘要： 基于带舍入学习（LWR）问题，一个分级全同态加密方案最近被提出。LWR问题是带误差学习（LWE）问题的变型，但它省掉了代价高昂的高斯噪声抽样，因此与现有基于LWE问题的全同态加密方案相比，该基于LWR问题的全同态加密方案具有更高的计算效率。然而，该基于LWR问题的全同态加密方案在同态运算时需要输入用户的运算密钥。因此，基于LWR问题构造了一个新的分级全同态加密方案，该方案在同态运算时不需要输入用户的运算密钥。鉴于所提方案可应用于构造基于身份的全同态加密方案、基于属性的全同态加密方案等，它具有比最近所提出的基于LWR问题的全同态加密方案更广泛的应用场景。

关键词: 全同态加密, 分级全同态加密, 带舍入学习问题, 带误差学习问题, 高斯噪声抽样

CLC Number:

TP309.7

LI Mingxiang, LIU Zhao, ZHANG Mingyan. Fully homomorphic encryption scheme without Gaussian noise[J]. Journal of Computer Applications, 2017, 37(12): 3430-3434.

李明祥, 刘照, 张明艳. 无高斯噪声的全同态加密方案[J]. 计算机应用, 2017, 37(12): 3430-3434.

References

[1] RIVEST R L, ADLEMAN L, DERTOUZOS M L. On data banks and privacy homomorphisms[M]//Foundations of Secure Computation. Salt Lake City, UT:Academic Press, 1978:169-179.
[2] GENTRY C. Fully homomorphic encryption using ideal lattices[C]//STOC 2009:Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:169-178.
[3] BRAKERSKI Z, VAIKUNTANATHAN V. Fully homomorphic encryption from ring-LWE and security for key dependent messages[C]//CRYPTO 2011:Proceedings of the 2011 Annual International Cryptology Conference, LNCS 6841. Berlin:Springer, 2011:505-524.
[4] LYUBASHEVSKY V, PEIKERT C, REGEV O. On ideal lattices and learning with errors over rings[C]//EUROCRYPT 2010:Proceedings of the 201029th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 6110. Berlin:Springer, 2010:1-23.
[5] BRAKERSKI Z, VAIKUNTANATHAN V. Efficient fully homomorphic encryption from (standard) LWE[C]//FOCS 2011:Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. Washington, DC:IEEE Computer Society, 2011:97-106.
[6] REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]//STOC 2005:Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York:ACM, 2005:84-93.
[7] BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. (Leveled) fully homomorphic encryption without bootstrapping[C]//ITCS 2012:Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. New York:ACM, 2012:309-325.
[8] GENTRY C, SAHAI A, WATERS B. Homomorphic encryption from learning with errors:conceptually-simpler, asymptotically-faster, attribute-based[C]//CRYPTO 2013:Proceedings of the 33rd Annual Cryptology Conference, LNCS 8042. Berlin:Springer, 2013:75-92.
[9] BANERJEE A, PEIKERT C, ROSEN A. Pseudorandom functions and lattices[C]//EUROCRYPT 2012:Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 7237. Berlin:Springer, 2012:719-737.
[10] BOGDANOV A, GUO S Y, MASNY D, et al. On the hardness of learning with rounding over small modulus[C]//Proceedings of the 201613th International Conference on Theory of Cryptography, LNCS 9562. Berlin:Springer, 2016:209-224.
[11] DUAN R, GU C X. Public key encryption schemes based on learning with rounding problem[C]//MINES 2013:Proceedings of the 20135th International Conference on Multimedia Information Networking and Security. Washington, DC:IEEE computer society, 2013:101-104.
[12] FANG F Y, LI B, LU X H, et al. (Deterministic) hierarchical identity-based encryption from learning with rounding over small modulus[C]//ASIA CCS 2016:Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security. New York:ACM, 2016:907-912.
[13] COSTACHE A, SMART N P. Homomorphic encryption without Gaussian noise[EB/OL].[2017-04-16]. https://eprint.iacr.org/2017/163.pdf.
[14] WANG F Q, WANG K P, LI B. An efficient leveled identity-based FHE[C]//NSS 2015:Proceedings of the 9th International Conference on Network and System Security, LNCS 9408. Berlin:Springer, 2015:303-315.
[15] 康元基,顾纯祥,郑永辉,等.利用特征向量构造基于身份的全同态加密体制[J].软件学报,2016,27(6):1487-1497.(KANG Y J, GU C X, ZHENG Y H, et al. Identity-based fully homomorphic encryption from eigenvector[J]. Journal of Software. 2016, 27(6):1487-1497.)
[16] 段然,顾纯祥,祝跃飞,等.NTRU格上高效的基于身份的全同态加密体制[J].通信学报,2017,38(1):66-75.(DUAN R, GU C X, ZHU Y F, et al. Efficient identity-based fully homomorphic encryption over NTRU[J]. Journal on Communications, 2017, 38(1):66-75.)
[17] 戴晓明,张薇,郑志恒,等.基于容错学习的GSW-型全同态层次型IBE方案[J].计算机应用,2016,36(7):1856-1860.(DAI X M, ZHANG W, ZHENG Z H, et al. GSW-type hierarchical identity-based fully homomorphic encryption scheme from learning with errors[J]. Journal of Computer Applications, 2016, 36(7):1856-1860.)
[18] CLEAR M, MCGOLDRICK C. Multi-identity and multi-key leveled FHE from learning with errors[C]//CRYPTO 2015:Proceedings of the 2015 Annual International Cryptology Conference, LNCS 9216. Berlin:Springer, 2015:630-656.
[19] PEIKERT C, SHIEHIAN S. Multi-key FHE from LWE, revisited[C]//Proceedings of the 2016 Theory of Cryptography Conference, LNCS 9986. Berlin:Springer, 2016:217-238.
[20] BRAKERSKI Z, CASH D, TSABARY R, et al. Targeted homomorphic attribute based encryption[C]//Proceedings of the 2016 Theory of Cryptography Conference, LNCS 9986. Berlin:Springer, 2016:330-360.
[21] HIROMASA R, KAWAI Y. Fully dynamic multi target homomorphic attribute-based encryption[EB/OL].[2017-05-19]. https://eprint.iacr.org/2017/373.pdf.
[22] PERIKERT C. Public-key cryptosystems from the worst-case shortest vector problem[C]//STOC 2009:Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York:ACM, 2009:333-342.
[23] MICCIANCIO D, MOL P. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions[C]//CRYPTO 2011:Proceedings of the 31st Annual International Cryptology Conference, LNCS 6841. Berlin:Springer, 2011:465-484.
[24] MICCIANCIO D, PEIKERT C. Trapdoors for lattices:simpler, tighter, faster, smaller[C]//EUROCRYPT 2012:Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 7237. Berlin:Springer, 2012:700-718.
[25] BRAKERSKI Z. Fully homomorphic encryption without modulus switching from classical GapSVP[C]//CRYPTO 2012:Proceedings of the 32nd Annual Cryptology Conference, LNCS 7417. Berlin:Springer, 2012:868-886.
[26] BARAK B, DODIS Y, KRAWCZYK H, et al. Leftover hash lemma, rivisted[C]//CRYPTO 2011:Proceedings of the 31st Annual International Cryptology Conference, LNCS 6841. Berlin:Springer, 2011:1-20.
[27] LENSTRA A K, JR H W L, LOVÁSZ L. Factoring polynomials with rational coefficients[J]. Mathematische Annalen,1982, 261(4):515-534.

Fully homomorphic encryption scheme without Gaussian noise

无高斯噪声的全同态加密方案

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

[1]	ZHENG Shangwen, LIU Yao, ZHOU Tanping, YANG Xiaoyuan. Optimized CKKS scheme based on learning with errors problem [J]. Journal of Computer Applications, 2021, 41(6): 1723-1728.
[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]	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.