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

A Threshold Public Key Encryption via Dual Regev Scheme

作　　者：李增鹏 王九如 张问银 马春光 LI Zeng-peng;WANG Jiu-ru;ZHANG Wen-yin;MA Chun-guang(College of Computer Science and Technology,Qingdao University,Qingdao 266071,China;School of Information Science and Engineering,Linyi University,Linyi 276000,China;School of Computer Science and Engineering,Shandong University of Science and Technology,Jinan 266071,China)

机构地区：[1]青岛大学计算机科学与技术学院,青岛266071 [2]临沂大学信息科学与工程学院,临沂276000 [3]山东科技大学计算机科学与工程学院,济南266071

出　　处：《北京邮电大学学报》2020年第4期83-87,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61802214,61932005);山东省自然科学基金项目(ZR2019BF009,ZR2018LF007);山东重点研发计划项目(2019GNC106027,2019JZZY010134);青岛市应用基础研究计划项目(19-6-2-6-cg);贵州省公共大数据重点实验室(贵州大学)开放课题项目(2019BDKFJJ007)。

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

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

分 类 号：TP309[自动化与计算机技术—计算机系统结构]