Identification Tokens — or: Solving The Chess Grandmaster Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 537)


Fiat and Shamir have proposed to use zero-knowledge interactive proofs to obtain secure identification mechanisms. Real time attacks in which active eavesdroppers relay questions and answers or in which the prover helps deliberately an impersonator have been described [4]. In this paper a solution against such frauds is given and (based on some physical assumptions) it is proved that the solution protects against the real-time attacks.


Final Paper Game Tree Interactive Proof Secure Identification Interactive Proof System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

6 References

  1. [1]
    C. H. Bennett and G. Brassard. An update on quantum cryptography. In Advances in Cryptology. Proc. of Crypto’84 (Lecture Notes in Computer Science 196), pp. 475–480. Springer-Verlag, New York, 1985. Santa Barbara, August 1984.Google Scholar
  2. [2]
    J. H. Conway. On numbers and games. Academic Press Inc., London, U.K., 1976.zbMATHGoogle Scholar
  3. [3]
    Y. Desmedt. Major security problems with the “unforgeable” (Feige-)Fiat-Shamir proofs of identity and how to overcome them. In Securicom 88, 6th worldwide congress on computer and communications security and protection, pp. 147–159. SEDEP Paris France, March 15–17, 1988.Google Scholar
  4. [4]
    Y. Desmedt, C. Goutier, and S. Bengio. Special uses and abuses of the Fiat-Shamir passport protocol. In C. Pomerance, editor, Advances in Cryptology, Proc. of Crypto’ 87 (Lecture Notes in Computer Science 293), pp. 21–39. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16–20.Google Scholar
  5. [5]
    A. Einstein. Relativitätstheorie. Friedr. Vieweg, Braunschwig, 1916.Google Scholar
  6. [6]
    U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2), pp. 77–94, 1988.MathSciNetCrossRefGoogle Scholar
  7. [7]
    A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto’86 (Lecture Notes in Computer Science 263), pp. 186–194. Springer-Verlag, 1987. Santa Barbara, California, U. S. A., August 11–15.Google Scholar
  8. [8]
    A. Fiat and A. Shamir. Unforgeable proofs of identity. In Securicom 87, pp. 147–153, March 4–6, 1987. Paris, France.Google Scholar
  9. [9]
    S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam J. Comput., 18(1), pp. 186–208, February 1989.MathSciNetCrossRefGoogle Scholar
  10. [10]
    P. D. Merillat. Secure stand-alone positive personnel identity verification system (ssa-ppiv). Technical Report SAND79-0070, Sandia National Laboratories, March 1979.Google Scholar
  11. [11]
    N. F. Ramsey. Precise measurement of time. American Scientist, 76, pp. 42–49, January–February 1988.Google Scholar
  12. [12]
    G. J. Simmons. A system for verifying user identity and authorization at the point-of sale or access. Cryptologia, 8(1), pp. 1–21, January 1984.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Fakultät für InformatikUniversität KarlsruheGermany
  2. 2.Dept. EE & CSUniv. of WisconsinMilwaukeeUSA

Personalised recommendations