A remark on the efficiency of identification schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 473 LNCS, Issue , 1991, Pages 493-495

  Burmester, Mike ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMMUNICATION COST; EFFICIENCY PARAMETERS; IDENTIFICATION SCHEME; MEMORY SIZE; PROBABILITY OF ERRORS; SECURITY LEVEL;

EFFICIENCY;

EID: 85027178867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46877-3_47     Document Type: Conference Paper

References (8)

1. E.F. Brickell, and K.S. McCurley. An interactive identification scheme based on discrete logarithms and factoring. Presented at Eurocrypt’90.
2. M. Burmester, and Y. Desmedt. Remarks on the soundness of proofs. Electronics Letters, 25(22), 1989, pp. 1509-1511.
3. U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2), 1988, pp. 77-94.
4. L.C Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. Proceedings of Eurocrypt’88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp. 123-128.
5. A. Fiat, and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. Proceedings of Crypto’86, Lecture Notes in Computer Science 206, Springer-Verlag, New York, pp. 186-194.
6. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam J. Comput., 18(1), 1989, pp. 186-208.
7. K. Ohta, and T. Okamoto. A modification of the Fiat-Shamir scheme. Proceedings of Crypto’88, Lecture Notes in Computer Science 403, Springer-Verlag, New York, pp. 232-243.
8. CP. Schnorr. Efficient Identifications and Signatures for Smart Cards. Proceedings of Crypto’89, Lecture Notes in Computer Science 435, Springer-Verlag, New York, pp. 239-251.