On the security of a practical identification

Journal of Cryptology

Volumn 12, Issue 4, 1999, Pages 247-260

  Shoup, Scheme Victor ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Identification scheme; Proof of security; Zero knowledge

Indexed keywords

EID: 0004746654     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900056     Document Type: Article

References (20)

1. M. Bellare and O. Goldreich. On defining proofs of knowledge. In Advances in Cryptology-Crypto '92, pages 390-420. LNCS 740. Springer-Verlag, Berlin, 1993.
2. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
3. E. F. Brickell and K. S. McCurley. An interactive identification scheme based on discrete logarithms and factoring. J. Cryptology, 5:29-39, 1992.
4. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. J. Cryptology, 1:77-94,1988.
5. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology-Cryplo '86, pages 186-194. LNCS 263. Springer-Verlag, Berlin, 1987.
6. M. J. Fischer, S. Micali, and C. Rackoff. A secure protocol for the oblivious transfer. J. Cryptology, 9(3):191-195,1996. Presented at Eurocrypt '84, but not published in those proceedings.
7. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. In Proceedings of the 17th ICALP, pages 268-282. LNCS 443. Springer-Verlag, Berlin, 1990.
8. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18:186-208,1989.
9. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17:281-308, 1988.
10. L. Guillou. Collision-resistance and zero-knowledge techniques. Manuscript, 1990.
11. L. Guillou and J. Quisquater. A practical zero-knowledge protocol fitted to security microprocesors minimizing both transmission and memory. In Advances in Cryptology-Eurocrypt '88, pages 123-128. LNCS 330. Springer-Verlag, Berlin, 1998.
12. L. Guillou and J. Quisquater. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology-Crypto '88, pages 216-231. LNCS 403, Springer-Verlag, Berlin, 1990.
13. M. Jakobsson. Reducing costs in identification protocols. Manuscript available at http://www-cse.ucsd.edu/users/raarkus, 1992.
14. S. Micali. An efficient digital signature algorithm provably secure as integer factorization. Manuscript, 1995.
15. K. Ohta and T. Okamoto. A modification of the Fiat-Shamir Scheme. In Advances in Cryptology-Cryplo '88, pages 232-243. LNCS 403. Springer-Verlag, Berlin, 1990.
16. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Advances in Cryptology-Crypto '92, pages 31-53. LNCS 740. Springer-Verlag, Berlin, 1993.
17. H. Ong and C. Schnorr. Fast signature generation with a Fiat-Shamir-like scheme. In Advances in Cryptology-Eurocrypt '90, pages 432140. LNCS 473. Springer-Verlag, Berlin, 1991.
18. C. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4:161-174,1991.
19. C. Schnorr. Security of 2'-root identification and signatures. In Advances in Cryptology-Crypto '96, pages 143-156. LNCS 1109. Springer-Verlag, Berlin, 1996.
20. C. Schnorr. Erratum: Security of 2′-root identification and signatures. In A avances in Cryptology-Crypto '97. LNCS 1294. Springer-Verlag, Berlin, 1997.