On the power of claw-free permutations

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

Volumn 2576, Issue , 2003, Pages 55-73

  Dodis, Yevgeniy ^a   Reyzin, Leonid ^b  

^a NEW YORK UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CLAW-FREE PERMUTATIONS; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC PRIMITIVES; EXACT SECURITY; PROBABILISTIC SIGNATURE SCHEMES; SECURITY ANALYSIS; SIGNATURE SCHEME; TRAPDOOR PERMUTATIONS;

AUTHENTICATION;

EID: 35248859171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36413-7_5     Document Type: Article

References (24)

1. Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, 15-17 May 1989.
2. Mihir Bellare and Silvio Micali. How to sign given any trapdoor function. In Goldwasser [Gol88], pages 200-215.
3. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communication Security, pages 62-73, November 1993. Revised version available from http://www.cs.ucsd.edu/~mihir/.
4. Mihir Bellare and Phillip Rogaway. The exact security of digital signatures: How to sign with RSA and Rabin. In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT 96, volume 1070 of Lecture Notes in Computer Science, pages 399-416. Springer-Verlag, 12-16 May 1996. Revised version appears in http://www-cse.ucsd.edu/users/mihir/papers/crypto-papers.html.
5. Jean-Sébastian Coron. On the exact security of full domain hash. In Mihir Bellare, editor, Advances in Cryptology - CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 229-235. Springer-Verlag, 20-24 August 2000.
6. Jean-Sébastian Coron. Optimal security proofs for PSS and other signature schemes. In Lars Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 272-287. Springer-Verlag, 28 April-2 May 2002.
7. Ivan Damgård. Collision-free hash functions and public-key signature schemes. In David Chaum and Wyn L. Price, editors, Advances in Cryptology - EUROCRYPT 87, volume 304 of Lecture Notes in Computer Science. Springer-Verlag, 1988, 13-15 April 1987.
8. Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1987, 11-15 August 1986.
9. Rosario Gennaro, Yael Gertner, and Jonathan Katz. Bounds on the efficiency of encryption and digital signatures. Technical Report 2002-22, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, 2002. Available from http://dimacs.rutgers.edu/TechnicalReports/2002.html.
10. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, April 1988.
11. Yael Gertner, Tal Malkin, and Omer Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 2001. IEEE.
12. Shafi Goldwasser, editor. Advances in Cryptology - CRYPTO '88, volume 403 of Lecture Notes in Computer Science. Springer-Verlag, 1990, 21-25 August 1988.
13. Louis Claude Guillou and Jean-Jacques Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. In Goldwasser [Gol88], pages 216-231.
14. Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, November 2000. IEEE.
15. Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In ACM [ACM89], pages 44-61.
16. Hugo Krawczyk and Tal Rabin. Chameleon signatures. In Network and Distributed System Security Symposium, pages 143-154. The Internet Society, 2000.
17. Jeong Han Kim, Daniel R. Simon, and Prasad Tetali. Limits on the efficiency of one-way permutation-based hash functions. In 40th Annual Symposium on Foundations of Computer Science, New York, October 1999. IEEE.
18. Silvio Micali. A secure and efficient digital signature algorithm. Technical Report MIT/LCS/TM-501, Massachusetts Institute of Technology, Cambridge, MA, March 1994.
19. Silvio Micali and Leonid Reyzin. Improving the exact security of digital signature schemes. Journal of Cryptology, 15:1-18, 2002.
20. Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In ACM [ACM89], pages 33-43.
21. Heidroon Ong and Claus P. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. In I. B. Damgård, editor, Advances in Cryptology - EUROCRYPT 90, volume 473 of Lecture Notes in Computer Science, pages 432-440. Springer-Verlag, 1991, 21-24 May 1990.
22. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, 2-6 May 1999.
23. John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 387-394, Baltimore, Maryland, 14-16 May 1990.
24. Daniel R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions. In Kaisa Nyberg, editor, Advances in Cryptology - EUROCRYPT 98, volume 1403 of Lecture Notes in Computer Science. Springer-Verlag, May 31-June 4 1998.