期刊文献+

共享的安全群签名方案 被引量:1

Secure group signature scheme shared among different groups
下载PDF
导出
摘要 可在不同群组间共享的、满足安全性要求的、有效的群签名方案是近来群签名研究的一个重要方面。基于离散对数的群签名方案允许不同群组可以共享系统公开参数,使用零知识证明的主要思想,充分保证了方案的安全性和有效性。共享方案可为不同群组间建立一个统一的安全的体系结构提供理论支持,有利于群签名方案的应用和管理。 New group signature schemes that are secure, effective and shared among different groups are an important direction in researching. The group signature scheme based on discrete logarithm problem can be used to share public parameter of the system among different organizations. Further, the main idea of the zero-knowledge proof is used to guarantee the security and efficiency of the scheme. Such sharing represents a high support for a uniform and secure system construction, and is favor to the management and application of the group signature system.
出处 《计算机工程与设计》 CSCD 北大核心 2006年第13期2314-2315,2408,共3页 Computer Engineering and Design
基金 国家自然科学基金项目(60273029)
关键词 群签名 离散对数 零知识证明 数字签名 安全性 group signature discrete logarithm proofs of zero-knowledge digital signature security
  • 相关文献

参考文献10

  • 1Chaum D,Heyst E V.Group signature[C].Advances in Cryptography-EUROCRYPT91,1991.257-265.
  • 2Ateniese G,Camenisch J,Joye M,et al.A practical and provably secure coalition-resistant group signature scheme[C].Advances in Cryptography-CRYPTO' 2000,2000.255-270.
  • 3Camenish J,Michels M.A group signature with improved efficiency[C].Advances in Cryptography-ASIACRYPT98,1998.160-174.
  • 4Camenisch J,Stadler M.Effient group signature for large groups[J].LNCS,1997,1296:410-424.
  • 5Kaisa Nyberg,Rainer A Rueppel.Massage recovery for signature schemes based on the discrete logarithm problem[C].Advances in Cryptology-EUROCRYPT94,1994.182-193.
  • 6Chaum P.Security without indentification:Transactions system to make big brother obsolete[J].CACM,1985,28(10):1030-1044.
  • 7Chaum D,Evertse J.A secure and privacy protecting protocol for transmitting personal information between organizations[C].Advances in Cryptology-CR YPTO'86,1986.118-167.
  • 8Camenisch J,Anna Lysyanskaya.Efficient non-transferable system with optimal anonymity revocation[C].Eurocrypt'01,2001.93-118.
  • 9Damgard I.Payment system and credential mechanisms with provable security against abuse by individuals[C].Advances in Crypto-CRYPTO'88,1988.328-335.
  • 10Fait A,Shamir A.How to prove yourself:Practical solutions to identification and signature problems[C].Advances in CryptoCR YPPTO'86,1987.186-194.

同被引文献6

  • 1邹仕顺,董平,苏力萍.基于椭圆加密的新型数字签名方案[J].计算机应用研究,2005,22(9):147-148. 被引量:6
  • 2Goh E-J,Jarecki S.A signature scheme as secure as the Diffie-Hellman problem [C]. Advance in Cryptology-EUROCRYPT, 2003:401-415.
  • 3Chevallier-Mames B.An efficient CDH-based signature scheme with a tight security reduction [C]. Advance in Cryptology- CRYPTO,2005:511-526.
  • 4Waters B. Efficient identity-based encryption without random Oracle[C].Proceedings of EUROCRYPT,2005:114-127.
  • 5Kenneth G Paterson,Jacob CN Schuldt.Efficient identity-based signature secure in the standard modcI[C].ACISP,2006:207-222.
  • 6王平水.基于零知识证明的签名方案研究[J].计算机工程与设计,2007,28(16):3834-3836. 被引量:2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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