IDENTIFICATION TOKENS OR - SOLVING THE CHESS GRANDMASTER PROBLEM.
LECT NOTES COMPUT SC
169 - 176.
Fiat and Shamir have proposed to use zero-knowledge interactive proofs to obtain secure identification mechanisms. Real time attacks in which active eaves-droppers relay questions and answers or in which the prover helps deliberately an impersonator have been described . 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.
|Title:||IDENTIFICATION TOKENS OR - SOLVING THE CHESS GRANDMASTER PROBLEM|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only