高效的格上基于身份的签名方案  

Efficient identity-based signature scheme from lattices

作　　者：李明祥[1] 刘阳[1] 赵秀明[1] 

机构地区：[1]河北金融学院信息管理与工程系,河北保定071051

出　　处：《计算机应用研究》2014年第3期825-828,共4页Application Research of Computers

基　　金：国家"973"重点基础研究发展规划项目基金资助项目(2011CB311809);国家自然科学基金项目(61163050);河北省教育厅资助科研项目(ZH2011216)

摘　　要：基于身份的签名(IBS)方案可广泛应用于移动电子商务等资源受限的场合。利用Micciancio和Peikert在Eurocrypt’12上提出的陷门生成算法GenTrap、原像抽样算法SampleD和陷门委托算法DelTrap构造了一个新的基于格的IBS方案,在标准模型下基于小整数解(SIS)问题证明了所提出的方案满足选择身份和固定选择消息攻击下的强不可伪造性,并比较了所提出的方案与现有基于格的IBS方案的计算性能,结果表明所提方案的效率最高。Identity-based signature （IBS） schemes can be widely used in the resource-constrained applications, such as mo- bile e-commerce. At first, it constructed a new lattice based IBS scheme by using trapdoor generation algorithm GenTrap, pre- image sampling algorithm SampleD, and trapdoor delegation algorithm DelTrap which were proposed on Eurocrypt 2012 by Micciancio and Peikert. Secondly, it proved the proposed scheme to satisfy the strong unforgeability against selective identity and static chosen message attacks under the small integer solution assumption in the standard model. Finally, the computing performance of the proposed scheme was compared with the existing lattice based IBS schemes. The comparison result shows that the proposed scheme enjoys the highest computation efficiency. Key words： signature; identity-based; strong, unforgeability; lattices

关 键 词：签名 基于身份 强不可伪造性 格 

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