基于混合离散对数的盲签名认证研究

Study About Blind Signature Authentication Based on Composite Discrete Logarithm

下载PDF

导出

摘要本文在分析混合系数的离散对数问题的基础上,提出了一种新的认证,这种认证比因式分解有更好的安全性,而且从证明者角度看来有更高的效率.最后我们得到一个基于信息不可识别性的安全性与因式分解相同的盲签名.

作者李波邱小平

机构地区重庆工学院计算机学院

出处《计算机科学》 CSCD 北大核心 2004年第7期80-83,共4页 Computer Science

基金教育部科技重点项目，重庆市科委科研项目

关键词离散对数盲签名认证混合系数不可识别性安全性因式分解

参考文献7

1Schnorr, Guillou. Quistquater Composite discrete logarithm and secure authentication. In: Third Intl. Workshop on Practice and Theory in Public Key Cryptosystems,PKC2000
2Brickell E F,McCurley K S. An interactive identification scheme based on discrete logarithm and factoring …, Advances in Cryp tology-Eurocrypt'90, LNCS 473, Springer-Verlag, pp. 481 -486
3Girault M. An identity-based identification scheme based on discrete logarithms modulo. a composite number Advances in Cryptology-Eurocrypt'90, LNCS 473, Springer-Verlag, pp. 581 -586
4Poupard. Practical multi-candidate election system. PODC 2001.274-283
5Feige U, Shamir A. Zero knowledge proofs of identity. In:Proc. of the Nineteenth Annual ACM Symposium on Theory of Computing,New York City,May 1987. 210-217
6Pointcheval. Provably Secure Blind Signature Schemes (1996)David. ASIACRYPT: Advances in Cryptology -- International Conference on the Theory and Application of Cryptology
7Girault M,Stern J. On the Length of Cryptographic Hash-Values used in Identification Schemes. Identification schemes. In: Proc.of Crypto 94, Lecture Notes in Computer Science 839,202-215

计算机科学

2004年第7期

内容加载中请稍等...