Identification Tokens — or: Solving The Chess Grandmaster Problem

  • Thomas Beth
  • Yvo Desmedt
Conference paper

DOI: 10.1007/3-540-38424-3_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 537)
Cite this paper as:
Beth T., Desmedt Y. (1991) Identification Tokens — or: Solving The Chess Grandmaster Problem. In: Menezes A.J., Vanstone S.A. (eds) Advances in Cryptology-CRYPT0’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Thomas Beth
    • 1
  • Yvo Desmedt
    • 2
  1. 1.Fakultät für InformatikUniversität KarlsruheGermany
  2. 2.Dept. EE & CSUniv. of WisconsinMilwaukeeUSA

Personalised recommendations