Security proofs for signature schemes

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

Volumn 1070, Issue , 1996, Pages 387-398

  Pointcheval, David ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CHOSEN MESSAGE ATTACKS; RANDOM ORACLE MODEL; SECURITY PROOFS; SIGNATURE SCHEME; SLIGHT VARIANT;

AUTHENTICATION;

EID: 84927727752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_33     Document Type: Conference Paper

References (15)

1. M. Bellare and P. Rogaway. Random Oracles are Practical: a paradigm for designing efficient protocols. InProceedings of the 1st ACM Conference on Computer and Communications Security, pages 62-73, 1993.
2. W. Diffie and M.E. Heilman. New Directions in Cryptography. InIEEE Transactions on Information Theortj, volume IT-22, no. 6, pages 644-654, november 1976.
3. A. Fiat and A. Shamir. How to Prove Yourself: practical solutions of identification and signature problems. In A. M. Odlyzko, editor,Advances in Cryptology - Proceedings of CRYPTO'86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1987.
4. T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. InIEEE Transactions on Information Theory, volume IT- 31, no. 4, pages 469-472, july 1985.
5. S. Goldwasser, S. Micali, and C. Rackoff. Knowledge Complexity of Interactive Proof Systems. InProceedings of the 17th ACM Symposium on the Theory of Computing STOC, pages 291-304. ACM, 1985.
6. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adapt.ative Chosen-Message Attacks.SIAM journal of computing, 17(2):281 -308, april 1988.
7. L.C. Guillou and J.-J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In C. G. Günter, editor,Advances in Cryptology-Proceedings of EUROCRYPT'88, volume 330 ofLecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
8. NIST. Secure Hash Standard (SHS). Federal Information Processing Standards PUBlication 180 1, April 1995.
9. D. Pointcheval. A New Identification Scheme Baaed on The Perceptrons Problem. In L.C. Guillou and J. J. Quisquater, editors,Advances in Cryptology - Proceedings of EUROCRYPT'95, volume 921 ofLecture Notes in Computer Science, pages 319-328. Springer-Verlag, 1995.
10. R. Rivest. The MD5 Message-Digest Algorithm. RFC 1321, April 1992.
11. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems.Communications of the ACM, 21(2):120-126, february 1978.
12. C.P. Schnorr. Efficient Identification and Signatures for Smart Cards. In G. Brassard, editor,Advances in Cryptology-Proceedings of CRYPTO'89, volume 435 of Lecture Notes in Computer Science, pages 235-251. Springer-Verlag, 1990.
13. A. Shamir. An Efficient Identification Scheme Based on Permuted Kernels. In G. Brassard, editor,Advances in Cryptology-Proceedings of CRYPTO'89, volume 435 ofLecture Notes in Computer Science, pages 606-609. Springer-Verlag, 1990.
14. J. Stern. A New Identification Scheme Based on Syndrome Decoding. In D. R. Stinson, editor,Advances in Cryptology-proceedings of CRYPTO'93, volume 773 ofLecture Notes in Computer Science, pages 13-21. Springer-Verlag, 1994.
15. J. Stern. Designing Identification Schemes with Keys of Short Size. In Y. G. Desmedt, editor,Advances in Cryptology-proceedings of CRYPTO'94, volume 839 ofLecture Notes in Computer Science, pages 164-173. Springer-Verlag, 1994.