Browse > Article

Study of Undeniable Signatures Schemes based on Zero-Knowledge Proof  

Gui, Yi-Qi (Dept. of Computer Science & Eng., Kangwon National Univ.)
Choi, Hwang-Kyu (Dept. of Computer Eng., Kangwon National)
Publication Information
Journal of Advanced Navigation Technology / v.14, no.5, 2010 , pp. 691-696 More about this Journal
Abstract
The main idea is to protect the signer of a document against the document being digitally distributed without the cooperation of signer. This paper proposes a new scheme of undeniable signature, which is so effective and improved D. Chaum's scheme. And our scheme which is zero-knowledge proved by using one-way function and partition - selection method, shows that its communication(challenge-response) only needs much fewer times during the confirmation protocol and disavowal protocol respectively, being very useful for wireless network environment. In the meantime our scheme allows the verifier to verify that the signature is valid, while the signer doesn't know the original message and the signature, to preserve the privacy of the verifier.
Keywords
zero knowledge; undeniable signature; one-way function;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. Mao, "Modern Cryptography: theory and practice," Prentice-Hall, PTR, USA, ISBN 0-13-066943-1, 2004.
2 D. Chaum, and Hans van Antwerpen, "Undeniable signatures," CRYPTO 1989, LNCS 435, Springer, pp. 212-216, 1990.
3 D. Chaum, "Zero-knowledge undeniable signatures," EUROCRYPT 1990, LNCS 473, Springer, pp. 458-464. 1991.
4 A. Fujioka, T, Okamoto. and K. Ohta, "Interactive Bi-Proof Systems and Undeniable Signature Schemes", Spring-Verlay, 1998.
5 W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Transactions on Information Theroy, Vol.IFT-22, No.6, pp644-654, 1976.
6 Y. Q. Gui, M. B. Kim, H. K. Choi, "A New Undeniable Signatures Scheme Based on Zero-Knowledge Proof", 20th fall Proceedings of Korean Society for Internet Information, pp.233-236, 2009.
7 S. Goldwasser, S. Micali, and C. Rackoff, "The Konwledge Complexity of Interactive Proof-Systems," Proceedings, 17th annual ACM Symposium on Theroy of Computing, pp.291-304, 1985.
8 M. Tompa and H. Wall, "Random Self-Reduccibility and Zero Knowledge Interactive Proofs of Possession of Information," 28th annual Symposium on Foundations of Compufer Science, IEEE, pp.472-482, 1987,
9 Z. Galil, S. Haber and C. Yung "Minimwn-Knowledge Interactive Proofs for Decision Problems," SIAM Journal on Computering, Vol. 18, No.4, pp.711-739, 1989.   DOI   ScienceOn