효율적인 영지식 부인봉쇄 프로토콜 연구

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)
  • 투고 : 2010.09.15
  • 심사 : 2010.10.30
  • 발행 : 2010.10.31

초록

본 논문은 부인봉쇄에서 영지식 검증을 위해 일방향 함수와 부분선택 방법을 사용하는 새로운 기법을 제한한다. 제안된 기법의 핵심은 서명자의 협조 없이 전달되는 문서에 대하여 서명자를 보호하는 것이다. 또한 본 논문은 확인과 부인 프로토콜 수행 과정에서 메시지 교환을 위한 통신비용을 최소화할 수 있음을 보이며, 이는 모바일 환경에 매우 유용하다. 한편 제안된 기법은 서명자가 원래 메시지와 서명을 모르는 상황에서 검증자의 비밀을 보호하면서 서명이 유효한지를 검사할 수 있는 검증자를 허용한다.

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.

키워드

참고문헌

  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. https://doi.org/10.1137/0218049