利用RLWE构造基于身份的全同态加密体制

doi:10.3969/j.issn.0372-2112.2016.12.011

电子学报 ›› 2016, Vol. 44 ›› Issue (12): 2887-2893.DOI: 10.3969/j.issn.0372-2112.2016.12.011

利用RLWE构造基于身份的全同态加密体制

辛丹¹, 顾纯祥¹, 郑永辉², 光焱¹, 康元基¹

1. 信息工程大学, 河南郑州 450002;
2. 数学工程与先进计算国家重点实验室, 江苏无锡 214125

收稿日期:2015-04-09 修回日期:2015-06-29 出版日期:2016-12-25
- 通讯作者:
- 顾纯祥
- 作者简介:
- 辛丹,女,1991年8月出生于陕西西安.现为信息工程大学硕士研究生.主要研究方向为全同态加密,在国内外期刊发表学术论文2篇.E-mail:xindan625@126.com;郑永辉,男,1976年出生于江西乐平.现为信息工程大学讲师,主要研究方向为密码学、网络与信息安全,在国内外重要期刊和会议上发表相关学术论文10余篇.E-mail:yonghui.zh@163.com;光焱,男,1983年出生于河南新乡.现为信息工程大学讲师,主要研究方向为密码学、网络与信息安全,在国内外重要期刊和会议上发表相关学术论文10余篇.E-mail:gyinarmy@126.com;康元基,男,1992年出生于内蒙古牙克石.现为信息工程大学研究生,主要研究方向为密码学、网络与信息安全.
- 基金资助:
- 河南省科技创新杰出青年基金 (No.134100510002）; 河南省基础与前沿技术研究 (No.142300410002）; 数学工程与先进计算国家重点实验室开放基金资助

Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem

XIN Dan¹, GU Chun-xiang¹, ZHENG Yong-hui², GUANG Yan¹, KANG Yuan-ji¹

1. Information Engineering University, Zhengzhou, Henan 450002, China;
2. State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi, Jiangsu 214125, China

Received:2015-04-09 Revised:2015-06-29 Online:2016-12-25 Published:2016-12-25
- Supported by:
- Science and Technology Innovation Outstanding Youth Fund of Henan Province (No.134100510002); Henan Research Program of Basic and Frontier Technology (No.142300410002); supported by Open Fund of State Key Laboratory of Mathematical Engineering and Advanced Computing

摘要/Abstract

摘要：

全同态加密为云计算中数据全生命周期隐私保护等难题的解决都提供了新的思路.公钥尺寸较大是现有全同态加密体制普遍存在的问题.本文将基于身份加密的思想和全同态加密体制相结合，利用环上容错学习问题（Ring Learning With Errors，RLWE），其中将环的参数m扩展到任意正整数，提出了一种基于身份的全同态加密体制.体制以用户身份标识作为公钥，在计算效率和密钥管理方面都具有优势，安全性在随机喻示模型下可规约为判定性RLWE问题难解性假设.

关键词: 全同态加密, 基于身份加密, 环上容错学习问题

Abstract:

Fully homomorphic encryption provides a new idea on the solution of many problems,such as the whole life cycle of data privacy protection on cloud computing.Currently,the existing fully homomorphic encryption schemes share a common flaw of large size public keys.We construct an identity-based fully homomorphic encryption which compromises the merits of both kinds of encryption from ring learning with errors to work in arbitrary cyclotomic rings.To make user's identity as the unique public key,our scheme has advantage in computational efficiency and key management.The security of our scheme strictly reduces to hardness of decision ring learning with problem solving in the random oracle model.

Key words: fully homomorphic encryption, identity-based, ring learning with errors

中图分类号:

TN918.1

辛丹, 顾纯祥, 郑永辉, 等. 利用RLWE构造基于身份的全同态加密体制[J]. 电子学报, 2016, 44(12): 2887-2893.

XIN Dan, GU Chun-xiang, ZHENG Yong-hui, et al. Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem[J]. Acta Electronica Sinica, 2016, 44(12): 2887-2893.

参考文献

[1] Gentry C.Fully homomorphic encryption using ideal lattices[A].Proceedings of 41rd ACM Symposium on Theory of Computing(STOC2009)[C].Bethesda,Maryland,USA:Springer Berlin Heidelberg,2009.169-178.
[2] Coron J S,Naccache D,Tibouchi M.Public key compression and modulus switching for fully homomorphic encryption over the integers[A].Proceedings of the 31st Annual Eurocrypt Conference[C].Cambridge,United Kingdom:Springer Berlin Heidelberg,2012.446-464.
[3] Brakerski Z,Vaikuntanathan V.Efficient fully homomorphic encryption from (standard) LWE[J].SIAM Journal on Computing,2014,43(2):831-871.
[4] López-Alt A,Tromer E,Vaikuntanathan V.On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[A].Proceedings of the 44th Annual ACM Symposium on Theory of Computing[C].New York,USA:ACM,2012.1219-1234.
[5] Shamir A.Identity-based cryptosystems and signature schemes[A].Advances in Cryptology[C].Santa Barbara,USA:Springer Berlin Heidelberg,1985.47-53.
[6] Naccache D.Is theoretical cryptography any good in practice? Invited talk at Crypto/CHES 2010[EB/OL].http://www.iacr.org/workshops/ches/ches2010,2010-08-17.
[7] Gentry C,Halevi S,Vaikuntanathan V.A simple BGN-type cryptosystem from LWE[A].Advances in Cryptology-EUROCRYPT 2010[C].French Riviera:Springer Berlin Heidelberg,2010.506-522.
[8] Regev O.On lattices,learning with errors,random linear codes,and cryptography[A].Proceeding of 37th Annual ACM Symposium on the Theory of Computing[C].Baltimore,MD,USA:ACM,2005.84-93.
[9] Brakerski Z.Fully homomorphic encryption without modulus switch-ing from classical GapSVP[A].Advances in Cryptology-CRYPTO 2012[C].Santa Barbara,CA,USA:Springer Berlin Heidelberg,2012.868-886.
[10] Gentry C,Sahai A,Waters B.Homomorphic encryption from learning with errors:Conceptually-simpler,asymptotically-faster,attribute-based[A].Proceedings of the 33th Annual International Cryptology Conference[C].Santa Barbara,USA:Springer Berlin Heidelberg,2013.75-92.
[11] Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic constructions[A].Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing[C].Victoria,British Columbia,Canada:ACM,2008.197-206.
[12] 光焱,祝跃飞,顾纯祥,等.利用容错学习问题构造基于身份的全同态加密体制[J].通信学报,2014,35(2):111-117. Guang Yan,Zhu Yue-fei,Gu Chun-xiang,et al.Identity-based fully homomorphic encryption from LWE problem[J].Journal on Communications,2014,35(2):111-117.
[13] Zvika Brakerski,Vinod Vaikuntanathan.Efficient fully homomorphic encryption from (standard) LWE[A].Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science[C].Palm Springs,California,USA:IEEE,2011.97-106.
[14] Brakerski Z,Vaikuntanathan V.Fully homomorphic encryption from ring-LWE and Security for key dependent messages[A].Advances in Cryptology-CRYPTO 2011[C].Santa Barbara,CA,USA:Springer Berlin Heidelberg,2011.505-524.
[15] Lyubashevsky V,Peikert C,Regev O.On Ideal Lattices and Learning with Errors over Rings[A].Advances in Cryptology-EUROCRYPT 2010[C].French Riviera:Springer Berlin Heidelberg,2010.1-23.
[16] Peikert C,Rosen A.Lattices that admit logarithmic worst-case to average-case connection factors[A].Proceedings of the 39th Annual ACM Symposium on Theory of Computing[C].San Diego,CA:ACM,2007.478-487.
[17] Lyubashevsky V,Micciancio D,Peikert C,et al.SWIFFT:A modest proposal for FFT hashing[A].Fast Software Encryption,15th International Workshop,FSE 2008[C].Lausanne,Switzerland:Springer Berlin Heidelberg,2008.54-72.
[18] Smart N P,Vercauteren F.Fully homomorphic SIMD operations[J].Designs,Codes and Cryptography,2014,71(1):57-81.
[19] Lyubashevsky V,Micciancio D.Generalized compact knapsacks are collision resistant[A].33rd International Colloquium,ICALP 2006,Automata,Languages and Programming[C].Venice,Italy:Springer,2006.144-155.
[20] Lyubashevsky V,Peikert C,Regev O.On ideal lattices and learning with errors over rings[J].Journal of the ACM (JACM),2013,60(6):43.
[21] Lyubashevsky V,Peikert C,Regev O.A toolkit for ring-LWE cryptography[A].EUROCRYPT,2013[C].Athens,Greece:Springer,2013.35-54.

利用RLWE构造基于身份的全同态加密体制

Identity-Based Fully Homomorphic Encryption from Ring Learning with Errors Problem

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 7

编辑推荐

Metrics

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