一种NTRU格上基于身份全同态加密体制设计

doi:10.3969/j.issn.0372-2112.2018.10.014

电子学报 ›› 2018, Vol. 46 ›› Issue (10): 2410-2417.DOI: 10.3969/j.issn.0372-2112.2018.10.014

一种NTRU格上基于身份全同态加密体制设计

段然^1,2, 顾纯祥^1,2, 祝跃飞¹, 郑永辉^1,2, 陈莉³

1. 信息工程大学四院, 河南郑州 450002;
2. 数学工程与先进计算国家重点实验室, 江苏无锡 214125;
3. 河南财经政法大学网络信息安全研究所, 河南郑州 450046

收稿日期:2017-06-15 修回日期:2017-11-01 出版日期:2018-10-25
- 作者简介:
- 段然,男.1989年生于北京.现为信息工程大学博士生,研究方向为信息安全.E-mail:darkrs@qq.com;顾纯祥,男.1976年生于安徽霍山.现为信息工程大学教授,研究方向为网络和信息安全;祝跃飞,男.1962年生于浙江杭州.现为信息工程大学教授,研究方向为信息安全;郑永辉,男.1976年生于江西乐平.现为信息工程大学副教授,研究方向为密码学;陈莉,女.1968年生于江苏如皋.现为河南财经政法大学教授,研究方向为信息安全理论与技术.
- 基金资助:
- 国家自然科学基金 (No.61502533）; 河南省科技创新杰出青年基金 (No.134100510002）; 河南省高校科技创新人才支持计划 (No.13HASTIT043）; 河南省基础与前沿技术研究 (No.142300410002）; 河南省自然科学基金 (No.162300410335）

An Identity-Based Fully Homomorphic Encryption Over NTRU Lattice

DUAN Ran^1,2, GU Chun-xiang^1,2, ZHU Yue-fei¹, ZHENG Yong-hui^1,2, CHEN Li³

1.Fourth Department, PLA Information Engineering University, Zhengzhou, Henan 450002, China;
2.State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi, Jiangsu 214125, China;
3.Institute of Network Information Security, Henan University of Economics and Law, Zhengzhou, Henan 450046, China

Received:2017-06-15 Revised:2017-11-01 Online:2018-10-25 Published:2018-10-25
- Supported by:
- National Natural Science Foundation of China (No.61502533); Science and Technology Innovation Outstanding Youth Fund of Henan Province (No.134100510002); Program for Science＆Technology Innovation Talents in Universities of Henan Province (No.13HASTIT043); Henan Research Program of Basic and Frontier Technology (No.142300410002); Natural Science Foundation of Henan Province (No.162300410335)

摘要/Abstract

摘要： 全同态加密可以用来解决云计算环境中的隐私保护问题，然而现有体制具有系统参数大、效率低的缺点.针对现有攻击技术，首先设计了一种高效的NTRU格上的基于身份公钥加密体制，无需借助额外的安全性假设，具有更高的安全性和更小的系统参数.之后，基于近似特征向量技术，构造了一种高效的全同态加密转化方式.通过将以上两种方法结合，给出了一种高效的基于身份全同态加密体制.和现有体制相比，除了不需要计算密钥、实现了真正意义上的基于身份特性以外，还减小了密钥、密文尺寸，提高了计算和传输效率.

关键词: 全同态加密, 基于身份加密, 环上带错学习问题, NTRU格, 近似特征向量

Abstract: Fully homomorphic encryption can be used to solve privacy concerns for data over cloud, while large parameters and low efficiency are the universal issues for present schemes. To oppose mainstream attacks, an identity-based public key scheme over NTRU lattice with smaller parameters, higher security level, and without additional security assumptions is put forward. Take advantage of the approximate eigenvector technique, an efficient fully homomorphic encryption transformation method is raised. And by combining the two skills above, an efficient identity-based fully homomorphic encryption scheme is proposed. Compared with existing schemes, the schemes is fully identity-based without evaluation key, and has smaller keys and ciphertext sizes, leading to higher transmission and computational efficiency.

Key words: fully homomorphic encryption, identity-based encryption, learning with errors over rings, number theory research unit (NTRU) lattice, approximate eigenvector

中图分类号:

TP309.7

段然, 顾纯祥, 祝跃飞, 等. 一种NTRU格上基于身份全同态加密体制设计[J]. 电子学报, 2018, 46(10): 2410-2417.

DUAN Ran, GU Chun-xiang, ZHU Yue-fei, et al. An Identity-Based Fully Homomorphic Encryption Over NTRU Lattice[J]. Acta Electronica Sinica, 2018, 46(10): 2410-2417.

参考文献

[1] Gentry C.Fully homomorphic encryption using ideal lattices[A].Proceedings of the 41st Annual ACM Symposium on Theory of Computing[C].New york:ACM,2009.169-178.
[2] Brakerski Z,Vaikuntanathan V.Fully homomorphic encryption from ring-LWE and security for key dependent messages[A].Proceedings of the 31st Annual International Cryptology Conference[C].Berlin:Springer,2011.505-524.
[3] Brakerski Z,Vaikuntanathan V.Efficient fully homomorphic encryption from (standard) LWE[J].SIAM Journal on Computing,2014,43(2):831-871.
[4] Brakerski Z,Gentry C,Vaikuntanathan V.(Leveled) Fully homomorphic encryption without bootstrapping[J].ACM Transactions on Computation Theory,2011,18(3):169-178.
[5] 汤殿华,祝世雄,王林,等.基于RLWE的全同态加密方案[J].通信学报,2014,35(1):173-182. TANG DH,ZHU SX,WANG L,et al.Fully homomorphic encryption scheme from RLWE[J].Journal of Communications,2014,35(1):173-182.(in Chinese)
[6] Zhang P,Yu JP,Wang T.A homomorphic aggregate signature scheme based on lattice[J].Chinese Journal of Electronics,2012,21(4):701-704.
[7] Gentry C,Groth J,Ishai Y,et al.Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proof[J].Journal of Cryptology,2015,28(4):820-843.
[8] Ducas L,Micciancio D.FHEW:Bootstrapping homomorphic encryption in less than a second[A].Proceeding of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2015.617-640.
[9] Gorbunov S,Vaikuntanathan V,Wichs D.Leveled fully homomorphic signatures from standard lattices[A].Proceedings of the 47th Annual ACM on Symposium on Theory of Computing[C].New york:ACM,2015.469-477.
[10] Peikert C,Shiehian S.Multi-key FHE from LWE,revisited[A].Proceedings of the 13th IACR Theory of Cryptography Conference[C].Berlin:Springer,2016.217-238.
[11] Benhamouda F,Lepoint T,Mathieu C,et al.Optimization of bootstrapping in circuits[A].Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms[C].New york:ACM,2017.2423-2433.
[12] 陈振华,李顺东,王道顺,等.集合成员关系的安全多方计算及其应用[J].电子学报,2017,45(5):1109-1116. CHEN ZH,LI SD,WANG DS,et al.Secure multiparty computation of set membership and its applications[J].Acta Electronica Sinica,2017,45(5):1109-1116.(in Chinese)
[13] Chen H,Hu YP,Lian ZZ.Properties of SV-style homomorphic encryption and their application[J].Chinese Journal of Electronics,2017,26(5):926-932.
[14] Regev O.On lattices,learning with errors,random linear codes,and cryptography[J].Journal of the ACM,2009,56(6):34.
[15] 光焱,祝跃飞,费金龙,等.利用容错学习问题构造基于身份的全同态加密体制[J].通信学报,2014,35(2):111-117. Guang Y,Zhu YF,Fei JL,et al.Identity-based fully homomorphic encryption from learning with error problem[J].Journal of Communications,2014,35(2):111-117.(in Chinese)
[16] Gentry C,Sahai A,Waters B.Homomorphic encryption from learning with errors:Conceptually-simpler,asymptotically-faster,attribute-based[A].Proceedings of the 33rd Annual International Cryptology Conference[C].Berlin:Springer,2013.75-92.
[17] Hoffstein J,Pipher J,Silverman JH.NTRU:A ring-based public key cryptosystem[A].Proceeding of the 3rd International Algorithmic Number Theory Symposium[C].Berlin:Springer,1998.267-288.
[18] Lyubashevsky V,Peikert C,Regev O.On ideal lattices and learning with errors over rings[J].Journal of the ACM,2013,60(6):43.
[19] Stehlé D,Steinfeld R.Making NTRU as secure as worst-case problems over ideal lattices[A].Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2011.27-47.
[20] Ducas L,Lyubashevsky V,Prest T.Efficient identity-based encryption over NTRU lattices[A].Proceedings of the 20th Annual International Conference on the Theory and Application of Cryptology and Information Security[C].Berlin:Springer,2014.22-41.
[21] Peikert C.A decade of lattice cryptography[J].Foundations and Trends in Theoretical Computer Science,2016,10(4):283-424.
[22] Lyubashevsky V,Prest T.Quadratic time,linear space algorithms for gram-schmidt orthogonalization and gaussian sampling in structured lattices[A].Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2015.789-815.
[23] Lyubashevsky V,Peikert C,Regev O.A toolkit for ring-LWE cryptography[A].Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2013.35-54.
[24] Ducas L,Nguyen PQ.Faster gaussian lattice sampling using lazy floating-point arithmetic[A].Proceedings of the 18th Annual International Conference on the Theory and Application of Cryptology and Information Security[C].Berlin:Springer,2012.415-432.
[25] Kirchner P,Fouque PA.An improved BKW algorithm for LWE with applications to cryptography and lattices[A].Proceedings of the 35th Annual International Cryptology Conference[C].Berlin:Springer,2015.43-62.
[26] Lepoint T,Naehrig M.A comparison of the homomorphic encryption schemes FV,and YASHE[A].Proceedings of the 7th International Conference on Cryptology in Africa[C].Berlin:Springer,2014.318-335.
[27] Gama N,Nguyen PQ.Predicting lattice reduction[A].Proceedings of the 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2008.31-51.
[28] Micciancio D,Regev O.Lattice-Based Cryptography[M].Berlin:Springer,2011.713-715.
[29] Lindner R,Peikert C.Better key sizes (and attacks) for LWE-based encryption[A].Proceedings of the 11th International Conference on Topics in Cryptology[C].Berlin:Springer,2011.319-339.
[30] Gama N,Nguyen PQ,Regev O.Lattice enumeration using extreme pruning[A].Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2010.257-278.
[31] Becker A,Ducas L,Gama N,et al.New directions in nearest neighbor searching with applications to lattice sieving[A].Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms[C].New york:ACM,2016.10-24.
[32] Chen Y,Nguyen PQ.BKZ 2.0:Better lattice security estimates[A].Proceeding of the 17th International Conference on the Theory and Application of Cryptology and Information Security[C].Berlin:Springer,2011.1-20.
[33] Aono Y,Wang YT,Hayashi T,et al.Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator[A].Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2016.789-819.
[34] Albrecht MR,Player R,Scott S.On the concrete hardness of learning with errors[J].Journal of Mathematical Cryptology,2015,9(3):169-203.
[35] 辛丹,顾纯祥,郑永辉,等.利用RLWE构造基于身份的全同态加密体制[J].电子学报,2016,44(12):2887-2893. XIN D,GU CX,ZHENG YH,et al.Identity-based fully homomorphic encryption from ring learning with errors problem[J].Acta Electronica Sinica,2016,44(12):2887-2893.(in Chinese)
[36] Micciancio D,Peikert C.Trapdoors for lattices:Simpler,tighter,faster,smaller[A].Proceedings of the 31th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2012.700-718.
[37] 康元基,顾纯祥,郑永辉,等.利用特征向量构造基于身份的全同态加密体制[J].软件学报,2016,27(6):1487-1497. KANG YJ,GU CX,ZHENG YH,et al.Identity-based fully homomorphic encryption from eigenvector[J].Journal of Software,2016,27(6):1487-1497.(in Chinese)

一种NTRU格上基于身份全同态加密体制设计

An Identity-Based Fully Homomorphic Encryption Over NTRU Lattice

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 7

编辑推荐

Metrics

[1]	李秋贤, 田有亮, 王缵. 基于全同态加密的理性委托计算协议[J]. 电子学报, 2019, 47(2): 470-474.
[2]	李子臣, 张卷美, 杨亚涛, 张峰娟. 基于NTRU的全同态加密方案[J]. 电子学报, 2018, 46(4): 938-944.
[3]	王小峰, 陈培鑫, 周寰, 苏金树. 一种可信安全的层次式基于身份加密系统[J]. 电子学报, 2016, 44(7): 1521-1529.
[4]	辛丹, 顾纯祥, 郑永辉, 光焱, 康元基. 利用RLWE构造基于身份的全同态加密体制[J]. 电子学报, 2016, 44(12): 2887-2893.
[5]	葛爱军, 马传贵, 程庆丰. 标准模型下CCA2安全且固定密文长度的模糊基于身份加密方案[J]. 电子学报, 2013, 41(10): 1948-1952.
[6]	明洋, 王育民. 标准模型下可证安全的通配符基于身份加密方案[J]. 电子学报, 2013, 41(10): 2082-2086.
[7]	李大伟;杨庚;朱莉. 一种基于身份加密的可验证秘密共享方案[J]. 电子学报, 2010, 38(9): 2059-2065.