본문 바로가기
KERD
논문KCI 등재

IMPERSONATION ATTACK ON THE STRONG IDENTIFICATION BASED ON A HARD-ON-AVERAGE PROBLEM

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we analyze a zero-knowledge identification scheme presented in [1], which is based on an average-case hard problem,called distributional matrix representability problem. On the contrary to the soundness property claimed in [1], we show that a simple impersonation attack is feasible.

Abstract

In this paper, we analyze a zero-knowledge identification scheme presented in [1], which is based on an average-case hard problem,called distributional matrix representability problem. On the contrary to the soundness property claimed in [1], we show that a simple impersonation attack is feasible.

참고문헌 (7)

  1. P. Caballero-Gil, "Strong identification based on a hard-on-average problem", IEICE Transection Fundamentals, E88-A(5), pp.1117~1121 (2005)
  2. A. Fiat, "How to prove yourself: practical solutions to identification and signature problems", CRYPTO '86, pp.186~194 (1987)
  3. S. Goldwasser, "The knowledge complexity of interactive proof systems", SIAM J. Comput., 18(1), pp.186~208 (1989)
  4. G. A. Jones, "Elementary Number Theory, Springer Undergraduate Mathematics Series" (1998), Springer-Verlag London, Ltd.
  5. L. Levin, "Average case complete problems", SIAM J. Comput., 15(1), pp.285~286 (1986)
  6. C. P. Schnorr, "Efficient identification and signatures for smart cards", CRYPTO '89, pp.239~252 (1990)
  7. R. Venkatesan, "Average case intractability of matrix and diophantine problems (extended abstract)", Proceedings of the 24th Annual Symposium on Theory of Computing, pp.632~642 (1992)

관련 논문AI추천

이 간행물의 다른 논문 (19건)