一个基于格的环签名方案的改进  

An Improvement of a Ring Signature Scheme Based on Lattices

作　　者：热娜.艾合买提 张娟 李伟 曾吉文[1,2] RENA Ehmet;ZHANG Juan;LI Wei;ZENG Jiwen(School of Mathematical Sciences,Xiamen University,Xiamen 361005,China;School of Mathematical Sciences,Xiamen University,Xiamen 361005,China)

机构地区：[1]厦门大学数学科学学院,福建厦门361005 [2]新疆师范大学数学科学学院,新疆乌鲁木齐830054

出　　处：《厦门大学学报（自然科学版）》2018年第2期238-242,共5页Journal of Xiamen University：Natural Science

基　　金：国家自然科学基金(11261060)

摘　　要：针对Wang等提出的基于格中困难问题的环签名方案不满足不可伪造性的问题,提出了一种改进的环签名方案.该方案在随机谕言模型下满足全密钥暴露下的匿名性和内部攻击下的不可伪造性.而且使用一种强陷门生成算法,保证了新的签名方案简单、高效且容易实施.Wang has proposed a ring signature scheme based on difficult problem in lattices,but it does not satisfy unforgeability against insider corruption.Hereby we present a ring signature scheme which is anonymous against full key exposure and unforgeable against insider corruption in the random oracle model.In our new signature schemes,we use strong trapdoor generation algorithms.Consequently,it is simple and efficient for proposed algorithms to be implemented.

关 键 词：环签名 格 不可伪造 强陷门 

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