On the (In)security of the Fiat-Shamir paradigm

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 102-113

  Goldwasser, Shafi ^a,b   Kalai, Yael Tauman ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING;

FIAT-SHAMIR TRANSFORMATION; RANDOM ORACLE MODEL; THREE ROUND PUBLIC COIN IDENTIFICATION;

SECURITY OF DATA;

EID: 0344550529     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. M. Abdalla, J. An, M. Bellare and C. Namprempre. From identification to signatures via the Fiat-Shamir transform: minimizing assumptions for security and forward-security. Advances in Cryptography-EUROCRYPT 02, Lecture Notes in Computer Science, Springer-Verlag, 2002.
2. B. Barak. How to go beyond the black-box simulation barrier. In Proc. of the 42nd FOCS, 2001.
3. D. Boneh and M. Franklin. Identity-based encryption from Weil pairing. Preliminary version in Crypto, 2001.
4. B. Barak and O. Goldreich. Universal arguments and their applications. Proceedings of the 17th IEEE Annual Conference on Computational Complexity, 2002.
5. B. Barak, O. Goldreich, R. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Crypto 2001.
6. M. Blum, S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4): 850-864 1984.
7. Mihir Bellare and Phillip Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the First Annual Conference on Computer and Communications Security. ACM, November 1993.
8. Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 209-218, Dallas, 23-26 May, 1998.
9. R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In 5th ACM Conference on Computer and Communications Security, pages 46-51. Singapore, Nov. 1999. ACM Press.
10. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22 (Nov.), pages 644-654, 1976.
11. C. Dwork, M. Naor, O. Reingold and L. Stockmeyer. Magic functions. In IEEE, editor, 40th Annual Symposium of Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 523-534, IEEE Computer Society Press, 1999.
12. U. Feige, A.Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2), pp. 77-94, 1988.
13. Amos Fiat and Adi Shamir. How to prove to yourself: practical solutions to identification and signature problems. In Advances in Cryptology-Crypto 86, pages 186-194, Springer, Berlin 1987.
14. Oded Goldreich. Foundations of Cryptography, volume 1 - Basic Tools. Cambridge University Press, 2001.
15. R. Gennaro, S. Halevi and T. Rabin. Secure hash-and-sign signatures without the random oracle. Advances in Cryptology - EUROCRYPT 99, Lecture Notes in Computer Science Vol. 1592, J. Stern ed., Springer-Verlag, 1999.
16. Oded Goldreich, Shafi Goldwasser and Silvio Micali. How to construct random functions. Journal of the Association of Computing Machinery, 33(4): 792-807, 1986.
17. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2): 281-308, April 1988.
18. L. Guillou and J. J. Quisquater. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. Advances in Cryptology-CRYPTO 88, Lecture Notes in Computer Science Vol. 403, S. Goldwasser ed., Springer-Verlag, 1988.
19. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In 24'th STOC, pages 723-732, 1992.
20. R.C. Merkle. A certified digital signature. Proceedings on Advances in Cryptology, pages 218-238, July 1989, Santa-Barbara, California.
21. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. Advances in Cryptology - CRYPTO 92, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.
22. R. Rivest. The MD5 message-digest algorithm. RFC 1321, April 1992.
23. Silvio Micali. Computationally sound proofs. SICOMP, vol. 30(4), pages 1253-1298, 2000. Preliminary version in 35th FOCS, 1994.
24. S. Micali and L. Reyzin. Improving the exact security of digital signature schemes. Journal of Cryptology, 15(1):1-18, 2002.
25. M. Naor. Bit commitment using pseudorandom generators. Journal of Cryptology, Vol.4, pages 151-158, 1991.
26. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. STOC 89.
27. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Advances in Cryptology-EUROCRYPT 96, vol. 1070 of Lecture Notes in Compute Science, pages 387-398. Springer-Verlag, 1996.
28. John Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. STOC 1990 387-394.
29. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology 4(3):161-174.