Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Published : 2010.01.31
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. P. Caballero-Gil, Strong identification based on a hard-on-average problem, IEICE Transection Fundamentals Vol. E88-A (2005), no. 5, 1117–1121. https://doi.org/10.1093/ietfec/e88-a.5.1117
  2. A. Fiat and A. Shamir, How to prove yourself: practical solutions to identification and signature problems, Advances in cryptology-CRYPTO '86 (Santa Barbara, Calif., 1986), 186–194, Lecture Notes in Comput. Sci., 263, Springer, Berlin, 1987.
  3. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), no. 1, 186–208. https://doi.org/10.1137/0218012
  4. G. A. Jones and J. M. Jones, Elementary Number Theory, Springer Undergraduate Mathematics Series. Springer-Verlag London, Ltd., London, 1998.
  5. L. Levin, Average case complete problems, SIAM J. Comput. 15 (1986), no. 1, 285–286.
  6. C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in cryptology-CRYPTO '89 (Santa Barbara, CA, 1989), 239–252, Lecture Notes in Comput. Sci., 435, Springer, New York, 1990.
  7. R. Venkatesan and S. Rajagopalan, Average case intractability of matrix and diophantine problems (extended abstract), In Proceedings of the 24th Annual Symposium on Theory of Computing, ACM Press, pp. 632–642, 1992.