期刊文献+

一种格上的群签名

A Group Signature Scheme Based on Lattice
下载PDF
导出
摘要 通过对2010年亚洲密码会上格基群签名方案进行安全性分析,发现已有的格基群签名方案不能抵抗陷害攻击.由于群管理员拥有所有群成员的签名密钥,因而能够伪造出所有群成员的合法签名.并且在群成员加入时,系统必须更新所有群成员的公私钥及追踪密钥,计算量大且效率低.并且该方案没有给出撤销群成员的方法,不能适应实际应用需求.本文基于格上最近向量的困难性,利用GPV签名,构造出一种能够抵抗陷害攻击并且能够有效进行群成员加入和撤销的格上群签名方案,并在随机预言机模型下证明了方案的安全性.分析了方案的性能,在相同安全条件下,新方案效率更高,实用性更强. Through the security analysis of a group signature scheme from lattice assumptions posted in Asia Crypto 2010,it shows that the existing scheme is vulnerable to trap attacks. The signing keys are generated by the group manger in the original scheme,thus the group manger can forge all group members' valid signatures. Besides, the group manger needs to update the public keys and all the group members' signing keys when group members join in, which is of high calculation and low efficiency. Meanwhile, the scheme dosen't provide a method to revoke group member, which is not applicable. Using GPV signature, an improved scheme based on the hardness of the closest vector problem is proposed, which is anti-trap attacks and proven to be secure in random model and can icrease and revoke group members dynamically more efficiently and applicably.
出处 《小型微型计算机系统》 CSCD 北大核心 2014年第9期2094-2098,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61272492 61103231 61103230)资助
关键词 群签名 陷害攻击 动态群 GPV group signature lattice track attack dynamic group GPV
  • 相关文献

参考文献12

  • 1Chaum D,Van Heyst E.Group signatures [C].In Advances in Cryptology-Eurocrypt' 91,Lecture Notes in Computer Science(LNCS),Springer,547:257-265.
  • 2蔡志伟,王立斌,马昌社.一种基于身份的高效短群签名方案[J].计算机工程,2011,37(18):145-147. 被引量:4
  • 3李继国,孙刚,张亦辰.标准模型下可证安全的本地验证者撤销群签名方案[J].电子学报,2011,39(7):1618-1623. 被引量:6
  • 4Matthew Franklin,Zhang Hai-bin.Unique group signatures [C].European Symposium on Research in Computer Security(ESORICS 2012),LNCS 7459,643,2012.Full version avaible,eprint.iacr.org/2012/204.
  • 5Gentry C,Perkert C,Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic construction [C].In:Symposium on Theory of Computing(STOC'08)Proceedings of the 40th Annual ACM Symposium on Theory of Computing,ACM Press,New York,2008:197-206.
  • 6Dov Gordon S,Jonathan Katz,Vinod Vaikuntanathan.A group signature scheme from lattice assumptions [C].In:Proceedings of the Advances in Cryprology-ASIA CRYPT' 10,Springer-Verlag,Berlin,2010:395-412.
  • 7Regev O.On lattices,learning with errors,random linear codes,and cryptography [C].In:STOC'05 Proceedings of the 27th Annual ACM Symposim on Theory of Computing,New York:ACM Press,2005:84-93.
  • 8Alwen I,Peikert C.Generating shorter bases for hard random lattices[C].In:Dagstuhl Seminar Proceedings,Wadern,Schloss Dagstuhl,2009:75-86.
  • 9Cramer R,Dangard I,Schoenmakers.Proofs of partial knowledge and simplified design of witness hiding protocols [C].Advances in Cryptology-Crypto '94,Springer,LNCS,1994,839:174-187.
  • 10Goldreich 0,Goldwasser S.On the limits of nonapproximability of lattice problem [J].Computer and System Sciences,2000,60(3):540-563.

二级参考文献19

  • 1张键红,伍前红,邹建成,王育民.一种高效的群签名[J].电子学报,2005,33(6):1113-1115. 被引量:25
  • 2Boyen X, Waters B. Compact Group Signatures Without Random Oracles[C]//Proc. of EUROCRYPT’06. Berlin, Germany: Sprin- ger-Verlag, 2006.
  • 3Boyen X, Waters B. Full-domain Subgroup Hiding and Constant-size Group Signatures[C]//Proc. of Public Key Cryptography’07. Berlin, Germany: Springer-Verlag, 2007.
  • 4Smart N, Warinschi B. Identity Based Group Signatures from Hierarchical Identity-based Encryption[C]//Proc. of Pairing-based Cryptography-pairing’09. Berlin, Germany: Springer-Verlag, 2009.
  • 5Seo J H, Kobayashi T, Ohkubo M, et al. Anonymous Hier-archical Identity-based Encryption with Constant Size Ciphertexts[C]//Proc. of PKC’09. Berlin, Germany: Springer- Verlag, 2009.
  • 6Liang Xiaohui, Cao Zhenfu, Shao Jun, et al. Short Group Signature Without Random Oracles[C]//Proc. of ICISC’07. Berlin, Germany: Springers-Verlag, 2007.
  • 7秦波,伍前红,Willy Susilo,穆怡,王育民,姜正涛.Short Group Signatures Without Random Oracles[J].Journal of Computer Science & Technology,2007,22(6):805-821. 被引量:1
  • 8Nakanishi T,Funabiki N.A short verifier-local revocation groupsignature schemes with backward unlinkability. IEICETransactions on Fundamentals of Electronics,Communicationsand Computer Sciences . 2007
  • 9Wang Shaohui.Modification and improvement on group signa-ture scheme without random oracles. International Sympo-sium on Electronic Commerce and Security′2008 .
  • 10Freeman M D.Converting pairing-based cryptosystems fromcomposite-order groups to prime-order groups[OL]. http://crypto.rd.francetelecom.com/events/eurocrypt2010/program . 2010

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部