Another look at “Provable security”. II

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

Volumn 4329 LNCS, Issue , 2006, Pages 148-175

  Koblitz, Neal ^a   Menezes, Alfred ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

PROVABLE SECURITY;

CRYPTOGRAPHY;

EID: 38149025069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11941378_12     Document Type: Conference Paper

References (43)

1. M. Abdalla and D. Pointcheval, Simple password-based encrypted key exchange protocols, Topics in Cryptology – CT-RSA 2005, LNCS 3376, Springer-Verlag, 2005, pp. 191-208.
2. M. Ajtai and C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, Proc. 29th Symp. Theory of Computing, A.C.M., 1997, pp. 284-293.
3. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Computing, 17 (1988), pp. 194-209.
4. P. Barreto, B. Libert, N. McCullagh, and J.-J. Quisquater, Efficient and provably-secure identity-based signatures and signcryption from bilinear maps, Advances in Cryptology – Asiacrypt 2005, LNCS 3788, Springer-Verlag, 2005, pp. 515-532.
5. M. Bellare, Practice-oriented provable-security, Proc. First International Workshop on Information Security (ISW ’97), LNCS 1396, Springer-Verlag, 1998, pp. 221-231.
6. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, Proc. First Annual Conf. Computer and Communications Security, ACM, 1993, pp. 62-73.
7. M. Bellare and P. Rogaway, Optimal asymmetric encryption — how to encrypt with RSA, Advances in Cryptology – Eurocrypt ’94, LNCS 950, Springer-Verlag, 1994, pp. 92-111.
8. S. Blackburn and K. Paterson, Cryptanalysis of a message authentication code due to Cary and Venkatesan, Fast Software Encryption 2004, LNCS 3017, Springer-Verlag, 2004, pp. 446-453.
9. L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. Computing, 15 (1986), pp. 364-383.
10. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Computing, 13 (1984), pp. 850-864.
11. D. Boneh and X. Boyen, Short signatures without random oracles, Advances in Cryptology – Eurocrypt 2004, LNCS 3027, Springer-Verlag, 2004, pp. 56-73.
12. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, Advances in Cryptology – Asiacrypt 2001, LNCS 2248, Springer-Verlag, 2001, pp. 514-532.
13. D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Advances in Cryptology – Eurocrypt ’98, LNCS 1233, Springer-Verlag, 1998, pp. 59-71.
14. D. Brown, Generic groups, collision resistance, and ECDSA, Designs, Codes and Cryptography, 35 (2005), pp. 119-152.
15. D. Brown, On the provable security of ECDSA, in I. Blake, G. Seroussi, and N. Smart, eds., Advances in Elliptic Curve Cryptography, Cambridge University Press, 2005, pp. 21-40.
16. D. Brown, Breaking RSA may be as difficult as factoring, http://eprint.iacr. org/2005/380
17. D. Brown, unpublished communication, February 2006.
18. M. Cary and R. Venkatesan, A message authentication code based on unimodu-lar matrix groups, Advances in Cryptology – Crypto 2003, LNCS 2729, Springer-Verlag, 2003, pp. 500-512.
19. J.-S. Coron, On the exact security of full domain hash, Advances in Cryptology – Crypto 2000, LNCS 1880, Springer-Verlag, 2000, pp. 229-235.
20. J.-S. Coron, Optimal security proofs for PSS and other signature schemes, Advances in Cryptology – Eurocrypt 2002, LNCS 2332, Springer-Verlag, 2002, pp. 272-287.
21. D. Eastlake, S. Crocker, and J. Schiller, RFC 1750 – Randomness Recommendations for Security, available from http://www.ietf.org/rfc/rfc1750.txt
22. R. Fischlin and C. P. Schnorr, Stronger security proofs for RSA and Rabin bits, J. Cryptology, 13 (2000), pp. 221-244.
23. R. Gennaro, An improved pseudo-random generator based on the discrete log problem, J. Cryptology, 18 (2005), pp. 91-110.
24. N. Howgrave-Graham, J. Dyer, and R. Gennaro, Pseudo-random number generation on the IBM 4758 Secure Crypto Coprocessor, Workshop on Cryptographic Hardware and Embedded Systems (CHES 2001), LNCS 2162, Springer-Verlag, 2001, pp. 93-102.
25. J. Katz and N. Wang, Efficiency improvements for signature schemes with tight security reductions, 10th ACM Conf. Computer and Communications Security, 2003, pp. 155-164.
26. D. Knuth, Seminumerical Algorithms, vol. 2 of Art of Computer Programming, 3rd ed., Addison-Wesley, 1997.
27. N. Koblitz and A. Menezes, Another look at “provable security,” to appear in J. Cryptology; available from http://eprint.iacr.org/2004/152.
28. P. Mackenzie and S. Patel, Hard bits of the discrete log with applications to password authentication, Topics in Cryptology – CT-RSA 2005, LNCS 3376, Springer-Verlag, 2005, pp. 209-226.
29. J. Manger, A chosen ciphertext attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as standardized in PKCS #1 v2.0, Advances in Cryptology – Crypto 2001, LNCS 2139, Springer-Verlag, 2001, pp. 230-238.
30. P. Q. Nguyen and J. Stern, Cryptanalysis of the Ajtai–Dwork cryptosystem, Advances in Cryptology – Crypto ’98, LNCS 1462, Springer-Verlag, 1998, pp. 223-242.
31. P. Q. Nguyen and J. Stern, The two faces of lattices in cryptology, Cryptography and Lattices – Proc. CALC 2001, LNCS 2146, Springer-Verlag, 2001, pp. 146-180.
32. P. Paillier and D. Vergnaud, Discrete-log-based signatures may not be equivalent to discrete log, Advances in Cryptology – Asiacrypt 2005, LNCS 3788, Springer-Verlag, 2005, pp. 1-20.
33. D. Pointcheval and J. Stern, Security proofs for signature schemes, Advances in Cryptology – Eurocrypt ’96, LNCS 1070, Springer-Verlag, 1996, pp. 387-398.
34. D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures, J. Cryptology, 13 (2000), pp. 361-396.
35. C. P. Schnorr, Efficient signature generation for smart cards, J. Cryptology, 4 (1991), pp. 161-174.
36. V. Shoup, Lower bounds for discrete logarithms and related problems, Advances in Cryptology – Eurocrypt ’97, LNCS 1233, Springer-Verlag, 1997, pp. 256-266.
37. V. Shoup, Why chosen ciphertext security matters, IBM Research Report RZ 3076 (#93122) 23/11/1998.
38. V. Shoup, OAEP reconsidered, Advances in Cryptology – Crypto 2001, LNCS 2139, Springer-Verlag, 2001, pp. 239-259.
39. A. Sidorenko, unpublished communication, March 2006.
40. A. Sidorenko and B. Schoenmakers, Concrete security of the Blum–Blum–Shub pseudorandom generator, Cryptography and Coding 2005, LNCS 3796, Springer-Verlag, 2005, pp. 355-375.
41. U. V. Vazirani and V. V. Vazirani, Efficient and secure pseudo-random number generation, Proc. IEEE 25th Annual Symp. Foundations of Computer Science, 1984, pp. 458-463.
42. A. Yao, Theory and applications of trapdoor functions, Proc. IEEE 23rd Annual Symp. Foundations of Computer Science, 1982, pp. 80-91.
43. A. Young and M. Yung, Malicious Cryptography: Exposing Cryptovirology, Wiley, 2004.