Proving tight security for rabin-williams signatures

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

Volumn 4965 LNCS, Issue , 2008, Pages 70-87

  Bernstein, Daniel J ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RABIN-WILLIAMS SIGNATURES; UNRANDOMIZED MESSAGES;

ALGORITHMS; MESSAGE PASSING; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 44449163915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78967-3_5     Document Type: Conference Paper

References (35)

1. Ashby, V. (ed.): First ACM conference on computer and communications security, Association for Computing Machinery, New York (1993);
2. See [5]
3. Atluri, V., Jaeger, T.: Proceedings of the 10th ACM conference on Computer and communications security. ACM Press, New York (2003);
4. See [15]
5. Barua, R., Lange, T. (eds.): INDOCRYPT 2006. LNCS, vol. 4329. Springer, Heidelberg (2006);
6. See [18]
7. Bellare, M. (ed.): CRYPTO 2000. LNCS, vol. 1880. Springer, Heidelberg (2000);
8. See [10]
9. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In [1], 62-73 (1993); Citations in this document: §1, §1, §1
10. Bellare, M., Rogaway, P.: The exact security of digital signatures: how to sign with RSA and Rabin. In [21], 399-416 (1996);
11. see also newer version [7]
12. Mihir Bellare, Phillip Rogaway, The exact security of digital signatures: how to sign with RSA and Rabin (1996) see also older version [6], http://www-cse.ucsd.edu/∼mih.ir/papers/exactsigs.html Citations in this document: §2
13. Bernstein, D.J.: RSA signatures and Rabin-Williams signatures: the state of the art (2008), http://cr.yp.to/papers.html#rwsota Citations in this document:
14. Blake-Wilson, S., Johnson, D., Menezes, A.: Key agreement protocols and their security analysis. In [12], 30-45 (1997); Citations in this document
15. Coron, J.-S.: On the exact security of Full Domain Hash. In [4], 229-235. MR 2002e:94l09. (2000), http://www.eleves.ens.fr/home/coron/publications/ publications.html Citations in this document: §1
16. Coron, J.-S.: Optimal security proofs for PSS and other signature schemes. In [16], 272-287. (2002), http://www.eleves.ens.fr/home/coron/ publications/publications.html Citations in this document: §1
17. Darnell, M.J. (ed.): Cryptography and Coding 1997. LNCS, vol. 1355. Springer, Heidelberg (1997);
18. See [9]
19. Goh, E.-J., Jarecki, S., Katz, J., Wang, N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology 20, 493-514 (2007);
20. See [15]
21. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17, 281-308 (1988), http://theory.lcs.mit.edu/∼rivest/publications.litml Citations in this document: §1, §7, §7, §7
22. Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In [2], 155-164 (2003) portions incorporated into [13], http://www.cs.umd.edu/∼jkatz/papers.html Citations in this document: §1, §8, §8
23. Knudsen, L. (ed.): EUROCRYPT 2002. LNCS, vol. 2332. Springer, Heidelberg (2002);
24. See [11]
25. Koblitz, N., Menezes, A.J.: Another look at "provable security" (revised May 4, 2005);
26. see also newer version [19], http://eprint.iacr.org/2004/152/ Citations in this document: §1, §1, §8
27. Koblitz, N., Menezes, A.J.: Another look at "provable security". II. In [3], 148-175 (2006), http://eprint.iacr.org/2006/229 Citations in this document: §1
28. Koblitz, N., Menezes, A.J.: Another look at "provable security". Journal of Cryptology 20, 3-37 (2007);
29. see also older version [17]
30. Kurosawa, K., Ogata, W.: Efficient Rabin-type digital signature scheme. Designs, Codes and Cryptography 16, 53-64 (1999); Citations in this document: §7, §7
31. Maurer, U.M. (ed.): EUROCRYPT 1996. LNCS, vol. 1070. Springer, Heidelberg (1996);
32. See [6]
33. Stinson, D.R.: Some observations on the theory of cryptographic hash functions (2001), http://eprint.iacr.org/2001/020 Citations in this document: §1
34. Stinson, D.R.: A polemic on notions of cryptographic security (2004), http://www.cacr.math.uwaterloo.ca/∼dstinson/pubs.html Citations in this document: §1
35. Yung, M. (ed.): CRYPTO 2002. LNCS, vol. 2442. Springer, Heidelberg (2002)