On the length of cryptographic hash-values used in identification schemes

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

Volumn 839 LNCS, Issue , 1994, Pages 202-215

  Girault, Marc ^a   Stern, Jacques ^b  

^a SEPT   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COLLISION RESISTANCE; HASH VALUE; IDENTIFICATION SCHEME; INTERACTIVE IDENTIFICATION; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84955562814     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_21     Document Type: Conference Paper

References (10)

1. W. Feller, An introduction to probability theory and its applications, J. Wiley & Sons, 1968.
2. [FFS88] U. Feige, A. Fiat and A. Shamir, Zero-knowledge proofs of identity, Journal of Cryptology, Vol. 1, No 2, 1988, pp. 77–94.
3. [FS86] A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Advances of Cryptology: Proceedings of CRYPTO’86, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, Berlin, 1987, pp. 186–194.
4. [GMR85] S. Goldwasser, S. Micali and C. Rackoff, The knowledge of interactive proof-systems, Proceedings of 17th ACM Symposium on Theory of Computing, 1985, pp. 291–304.
5. [GQ88] L.C. Guillou and J.J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory, Advances of Cryptology: Proceedings of EUROCRYPT’88, Lecture Notes in Computer Science, Vol. 330, Springer-Verlag, Berlin, 1988, pp. 123–128.
6. [PS87] J.M. Pollard and C.P. Schnorr, An efficient solution of the congruence x 2 + ky 2 = m (mod n), IEEE Transactions on Information Theory, Vol. IT-33, No 5, 1987, pp. 702–709.
7. C.P. Schnorr, Efficient identification and signature for smart cards, Advances of Cryptology: Proceedings of CRYPTO’89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, Berlin, 1987, pp. 239–252.
8. A. Shamir, An efficient identification scheme based on permuted kernels, Advances of Cryptology: Proceedings of CRYPTO’89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, Berlin, 1987, pp. 606–609.
9. J. Stern, An alternative to the Fiat-Shamir protocol, Advances of Cryptology: Proceedings of EUROCRYPT’89, Lecture Notes in Computer Science, Vol. 434, Springer-Verlag, Berlin, 1990, pp. 173–180.
10. [St93] J. Stern, A new identification scheme based on syndrome decoding, Advances of Cryptology: Proceedings of CRYPTO’93, to appear.