期刊文献+

零知识数字签名方案中Hash值长度的研究

Study on Length of Hash-Values for Digital Signature Schemes Based on Zero-Knowledge
在线阅读 下载PDF
导出
摘要 Hash函数已经被广泛用于各种数字签名方案中。在基于零知识概念的数字签名方案中,方案发明者宣称:所使用的Hash值的长度短至64-bits或72-bits即可达到2-64或者2-72的安全度。文中研究表明,在数字签名中由于存在来自签名者的生日攻击,如此短的Hash值并不能达到规定的安全度。并提出了一个简单的修改方案,使得在不增加计算复杂性的情况下来达到规定的安全度。 Hash function has already been applied in all kinds of digital signature schemes. In digital signature schemes based on the zero- knowledge concept, it has been claimed that the length of Hash - values could be as short as 64 or 72 bits for the security of 2^-64 or 2^-72. Shows that signature schemes with such short Hash - values cannot achieve the stated security levels, due to the birthday attack by the signer. A simple modification is also presented, where the stated security levels can be obtained without increase of computational load.
作者 王平水
出处 《计算机技术与发展》 2007年第6期170-172,共3页 Computer Technology and Development
基金 安徽省教育厅自然科学基金资助项目(2006KJ017C)
关键词 数字签名 单向HASH函数 零知识证明 digital signature one - way Hash function zero - knowledge proof
  • 相关文献

参考文献9

  • 1Goldwasser S,Micali S,Rackoff C.The Knowledge Complexity of Interactive Proof System[C]//In:Proc.17th Annual ACM STOC 85.Providence,Rhode Island,NY,USA:ACM Press,1985:291-304.
  • 2Fiat A,Shamir A.How to Prove You self:Practical Solution to Identification and Signature Problems[C]//In Advances in Cryptology-Crypto'86,LNCS 263.Berlin,Heidelberg:Springer-Verlag,1988:186-194.
  • 3王尚平,王育民,王晓峰,秦波,张亚玲.基于零知识证明的前向安全数字签名方案[J].通信学报,2003,24(9):42-47. 被引量:21
  • 4Nyberg K,Rueppel R R.Message Recovery for Signature Schemes Based on the Discrete Logrithm Problem[C]//In Advances in Cryptology-Eurocrypto'94,LNCS 950.Berlin,Heidelberg:Springer-Verlag,1995:146-158.
  • 5Lim C H,Lee P J.More Flexible Exponentiation with Precomputation[C]//In Advances in Cryptology-Crypto'94.LNCS 839.Berlin,Heidelberg:Springer-Verlag,1994:95 -107.
  • 6Poinctcheval D,Stern J.Security arguments for digital signatures[J].Journal of Cryptology,2000,113 (3):361-396.
  • 7Joux A.Multicollisions in iterated hash functions:Application to cascaded constructions[C]//In:Crypto 2004,LNCS 3152.Berlin:Springer-Verlag,2004:306-316.
  • 8王张宜,李波,张焕国.Hash函数的安全性研究[J].计算机工程与应用,2005,41(12):18-19. 被引量:27
  • 9褚红伟,葛玮.基于Schnorr算法的多重数字签名方案[J].计算机工程,2005,31(23):119-120. 被引量:4

二级参考文献18

  • 1王长林,胡予濮.Schnorr签名对自适应攻击的安全性[J].通信技术,2003,36(5):97-98. 被引量:1
  • 2BELLARE M, MINER S. A forward-secure digital signature scheme[A]. Advances in Cryptology-CRYPTO'99,Lecture Notes in Compute Science[C]. Spring-Verlag, 1999.431-448.
  • 3RIVEST R, SHAMIR A, ADLMAN L. A method for obtaining digital signatures and public-key cryptosystems[J].Communlcations ACM, 1978, 21(2):120-126.
  • 4POINCTCHEVAL D, STERN J. Security proof for signature schemes[A]. Advances in Cryptology-EUROCRYPTO'96, Lecture Notes in Compute Science Vol. 1070[C]. Spring-Verlag, 1996. 387-398.
  • 5GOLDWASSER S, MICLIS. Probabilistic encryption[J]. Journal of computer and system, 1984, 28(2):270-299.
  • 6BELLARE M, ROGAAWAY P. Random oracles are practical: a paradigm for designing efficient protocols[A]. Proceedings of the First Annual Conference on Computer and Communications Security[C]. 1993.1-20.
  • 7BELLARE M, ROGAAWAY P. The exact security of digital signatures: How to sign with RSA and Rabin[A]. Advances in Cryptology-EUROCRYPTO'96, Lecture Notes in Compute Science[C]. Spring-Verlag, 1996. 399-416.
  • 8CAMENISCH J, STADLER M. Efficient group signatures schemes for large groups[A]. Advances in Cryptology-CRYPT'97, Lecture Notes in Compute Science[C]. Berlin: Springer-Verlag, 1997.410-423.
  • 9POINCTCHEVAL D, STERN J. Security arguments for digital signatures[J]. Journal of Cryptology, 2000, 113(3):361-396.
  • 10I Damgard. A Design Principle for Hash Functions[C].In:Crypto 89,LNCS 435,416~427.

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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