一种基于对偶Regev加密的门限公钥加密方案

doi:10.13190/j.jbupt.2019-239

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (4): 83-87.doi: 10.13190/j.jbupt.2019-239

一种基于对偶Regev加密的门限公钥加密方案

李增鹏¹, 王九如², 张问银², 马春光³

1. 青岛大学计算机科学与技术学院, 青岛 266071;
2. 临沂大学信息科学与工程学院, 临沂 276000;
3. 山东科技大学计算机科学与工程学院, 济南 266071

收稿日期:2019-11-09 发布日期:2020-08-15
通讯作者: 王九如(1983-),男,副教授,E-mail:wangjiuru@lyu.edu.cn. E-mail:wangjiuru@lyu.edu.cn
作者简介:李增鹏(1989-),男,助理教授.
基金资助:
国家自然科学基金项目（61802214，61932005）；山东省自然科学基金项目（ZR2019BF009，ZR2018LF007）；山东重点研发计划项目（2019GNC106027，2019JZZY010134）；青岛市应用基础研究计划项目（19-6-2-6-cg）；贵州省公共大数据重点实验室（贵州大学）开放课题项目（2019BDKFJJ007）

A Threshold Public Key Encryption via Dual Regev Scheme

LI Zeng-peng¹, WANG Jiu-ru², ZHANG Wen-yin², MA Chun-guang³

1. College of Computer Science and Technology, Qingdao University, Qingdao 266071, China;
2. School of Information Science and Engineering, Linyi University, Linyi 276000, China;
3. School of Computer Science and Engineering, Shandong University of Science and Technology, Jinan 266071, China

Received:2019-11-09 Published:2020-08-15

摘要/Abstract

摘要： 针对Regev方案不能有效地抵抗密钥恢复攻击的问题，提出一种基于Gentry-Peikert-Vaikuntanathan（GPV）方案的门限公钥加密方案.方案主要由分布式密钥生成协议和有效非交互的解密协议构成，融合了Shamir秘密共享算法和拉格朗日算法，使之能够抵抗静态和被动敌手收买的攻击.通过理论分析证明了所提方案的正确性.在通用可组合的框架下，验证了所提方案的安全性.

关键词: 格基密码学, 门限密码, 容错学习, 安全协议

Abstract: Aiming at the problem that Regev scheme cannot effectively resist key recovery attack, a threshold public key encryption scheme is proposed based on Gentry-Peikert-Vaikuntanathan (GPV) scheme. The scheme is mainly composed of a distributed key generation protocol and an effective non-interactive decryption protocol. It combines Shamir's secret sharing algorithm and Lagrangian algorithm, which make it resistant to static and passive adversary buying attacks. The correctness of the proposed scheme is proved through theoretical analysis. Moreover, under the universal composable framework, the security is verified.

Key words: lattice-based cryptography, threshold cryptosystem, learning with errors, security protocol

中图分类号:

TP309

李增鹏, 王九如, 张问银, 马春光. 一种基于对偶Regev加密的门限公钥加密方案[J]. 北京邮电大学学报, 2020, 43(4): 83-87.

LI Zeng-peng, WANG Jiu-ru, ZHANG Wen-yin, MA Chun-guang. A Threshold Public Key Encryption via Dual Regev Scheme[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 83-87.

参考文献

[1] Bendlin R, Damgard I. Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems[C]//Theory of Cryptography Conference. Heidelberg:Springer, 2010:201-218.
[2] Regev O. On lattices, learning with errors, random linear codes, and cryptography[C]//Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. New York:ACM, 2005:84-93.
[3] Frederiksen T. A multi-bit threshold variant of Regev's LWE-based cryptosystem[J/OL]. Cryptology ePrint Archive, 2011:1[2019-11-18]. http://daimi.au.dk/~jot2re/lwe/resources/report2.pdf.
[4] Li Zengpeng, Ma Chunguang, Wang Ding. Leakage resilient leveled FHE on multiple bit message[J]. IEEE Transactions on Big Data, 2017:7.
[5] Brakerski Z, Halevi S, Polychroniadou A. Four round secure computation without setup[J/OL]. Cryptology e Print Archive, 2017:386[2019-10-12]. http://eprint.iacr.org/2017/386.
[6] Brakerski Z, Gentry C, Halevi S. Packed ciphertexts in LWE-based homomorphic encryption[C]//16th International Conference on Practice and Theory in Public-Key Cryptography. Heidelberg:Springer, 2013:1-13.
[7] Boneh D, Gennaro R, Goldfeder S, et al. Threshold cryptosystems from threshold fully homomorphic encryption[C]//38th Annual International Cryptology Conference. Heidelberg:Springer, 2018:565-596.
[8] Boneh D, Gennaro R, Goldfeder S, et al. A lattice-based universal thresholdizer for cryptographic systems[J/OL]. IACR Cryptology ePrint Archive, 2017:251[2019-10-21]. https://eprint.iacr.org/2017/251.pdf.
[9] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions[C]//40th Annual ACM Symposium on Theory of Computing. New York:ACM, 2008:197-206.
[10] Shamir A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613.
[11] Canetti R. Universally composable security:a new paradigm for cryptographic protocols[C]//42nd IEEE Symposium on Foundations of Computer Science. Los Alamitos:IEEE Computer Society, 2001:136-145.
[12] Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer[C]//28th Annual Intermational Cryptology Conference on Cryptology:Advances in Cryptology. Heidelberg:Spinger, 2008:554-571.
[13] Li Zengpeng, Wang Jiuru, Zhang Wenyin. Revisiting post-quantum hash proof systems over lattices for internet of thing authentications[J]. Journal of Ambient Intelligence and Humanized Computing, 2019:10.

一种基于对偶Regev加密的门限公钥加密方案

A Threshold Public Key Encryption via Dual Regev Scheme

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价

[1]	汤永利, 胡明星, 叶青, 秦攀科, 于金霞. 改进的格上基于多身份全同态加密方案[J]. 北京邮电大学学报, 2018, 41(1): 125-133.
[2]	杨元原,马文平,刘维博. 模型检测中可变攻击者模型的构造[J]. 北京邮电大学学报, 2011, 34(2): 54-57.
[3]	龙士工，罗文俊，袁超伟，李祥. 串空间模型中的口令猜测攻击[J]. 北京邮电大学学报, 2007, 30(1): 62-65.
[4]	郑文慧, 马跃, 蒋砚军. IPsec与NAT兼容问题的研究和解决方案[J]. 北京邮电大学学报, 2002, 25(4): 61-64.
[5]	葛建军, 马跃, 喻伟. 因特网密钥交换协议IKE的分析及改进[J]. 北京邮电大学学报, 2001, 24(2): 73-75.
[6]	曾志峰,冯运波,杨义先. 虚拟专用网的研究与实现[J]. 北京邮电大学学报, 2000, 23(2): 72-76.