基于格的盲签名方案  

Lattice-based Blind Signature Schemes

作　　者：王凤和[1,2] 胡予濮[1] 王春晓[3] 

机构地区：[1]西安电子科技大学计算机网络与信息安全教育部重点实验室,西安市太白南路2号710071 [2]泰山学院数学与系统科学学院,泰安市迎宾大道中段15号271021 [3]山东建筑大学理学院,济南市凤鸣路2号250101

出　　处：《武汉大学学报（信息科学版）》2010年第5期550-553,共4页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(60673072;60803149;60970119)

摘　　要：利用原像抽样函数,在整数格上设计了一个2轮盲签名方案,实现了消息对签名者的无条件盲性,在随机预言机模型下,基于格上最小整数解(SIS)问题的困难性假设,证明盲签名方案满足one-more不可伪造性。与Markus Rückert设计的格上基于原像抽样函数的3轮盲签名比较,新方案签名轮数更少,签名长度更短,因此效率更高,而且新方案有效地解决了Markus Rückert方案中存在的签名失败问题。Using preimage sampleable functions,we propose a new lattice-based two moves blind signature scheme.The proposed scheme is not only unconditionally blind but also one-more unforgeable due to the hardness of the shortest integral solution on lattice,which is proved in the random oracle model.Compared with a well known lattice-based three moves blind signature scheme introduced by Markus Rückert,it shows that the proposed scheme can avoid the failure to sign,Moreover,the proposed scheme has less moves（two moves） and shorter length of signature.Hence it can be concluded that the proposed scheme is more efficient than the known lattice-based blind signature scheme.

关 键 词：盲签名 原像抽样函数 格 

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