The brave new world of bodacious assumptions in cryptography

Notices of the American Mathematical Society

Volumn 57, Issue 3, 2010, Pages 357-365

  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

EID: 76749109041     PISSN: 00029920     EISSN: 10889477     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, The one-more-RSA inversion problems and the security of Chaum's blind signature scheme, J. Cryptology 16 (2003), pp. 185-215.
2. M. Bellare and A. Palacio, GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks, Advances in Cryptology-Crypto 2002, LNCS 2442, Springer-Verlag, 2002, pp. 149-162.
3. 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.
4. D. Bernstein, Proving tight security for Rabin-Williams signatures, Advances in Cryptology- Eurocrypt 2008, LNCS 4965, Springer-Verlag, 2008, pp. 70-87.
5. D. Bleichenbacher, A chosen ciphertext attack against protocols based on the RSA encryption standard PKCS #1, Advances in Cryptology-Crypto'98, LNCS 1462, Springer-Verlag, 1998, pp. 1-12.
6. A. Boldyreva, Efficient threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme, Proc. Public Key Cryptography 2003, LNCS 2567, Springer-Verlag, 2003, pp. 31-46.
7. A. Boldyreva, C. Gentry, A. O'Neill, and D. H. Yum, Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing, Proc. 14th ACM Conference on Computer and Communications Security, CCS 2007, ACM Press, 2007, pp. 276-285; full version available at http://eprint.iacr.org/2007/438.
8. D. Boneh and X. Boyen, Short signatures without random oracles, Advances in Cryptology- Eurocrypt 2004, LNCS 3027, Springer-Verlag, 2004, pp. 56-73.
9. D. Boneh and X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups, J. Cryptology 21 (2008), pp. 149-177.
10. D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology-Crypto 2001, LNCS 2139, Springer-Verlag, 2001, pp. 213-229.
11. D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, SIAM J. Computing 32 (4) (2003), pp. 586-615.
12. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, J. Cryptology 17 (2004), pp. 297-319.
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. X. Boyen, The uber-assumption family: A unified complexity framework for bilinear groups, Pairing-Based Cryptography-Pairing 2008, LNCS 5209, Springer-Verlag, 2008, pp. 39-56.
15. D. Brown and R. Gallant, The static Diffie-Hellman problem, available at http://eprint.iacr.org/2004/306.
16. D. Cash, E. Kiltz, and V. Shoup, The twin Diffie-Hellman problem and applications, Advances in Cryptology-Eurocrypt 2008, LNCS 4965, Springer-Verlag, 2008, pp. 127-145.
17. J. Cheon, Security analysis of the Strong Diffie-Hellman problem, Advances in Cryptology- Eurocrypt 2006, LNCS 4004, Springer-Verlag, 2006, pp. 1-11.
18. W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory, IT-22, 1976, pp. 644-654.
19. F. Hess, Weil descent attacks, in Advances in Elliptic Curve Cryptography, ed. by I. Blake, G. Seroussi, and N. Smart, Cambridge University Press, 2005, pp. 151-182.
20. J. Y. Hwang, D. H. Lee, and M. Yung, Universal forgery of the Identity-Based Sequential Aggregate Signature Scheme, ACM Symposium on Information, Computer & Communication Security, ASIACCS 2009.
21. D. Jao and K. Yoshida, Boneh-Boyen signatures and the Strong Diffie-Hellman problem, Pairing-Based Cryptography-Pairing 2009, LNCS 5671, Springer-Verlag, 2009, pp. 1-16.
22. A. Joux, A one round protocol for tripartite Diffie-Hellman, Algorithmic Number Theory: Fourth International Symposium, LNCS 1838, Springer-Verlag, 2000, pp. 385-393.
23. A. H. Koblitz, N. Koblitz, and A. Menezes, Elliptic curve cryptography: The serpentine course of a paradigm shift, to appear in J. Number Theory, available at http://eprint.iacr.org/2008/390.
24. N. Koblitz and A. Menezes, Another look at "provable security", J. Cryptology 20 (2007), pp. 3-37.
25. N. Koblitz and A. Menezes, Another look at non-standard discrete log and Diffie-Hellman problems, J. Math. Cryptology 2 (2008), pp. 311-326.
26. U. Maurer and S. Wolf, The Diffie-Hellman protocol, Designs, Codes and Cryptography 19 (2000), pp. 147-171.
27. V. I. Nechaev, Complexity of a deterministic algorithm for the discrete logarithm, Mathematical Notes 55 (2) (1994), pp. 165-172.
28. M. Rabin, Digitalized signatures and public-key functions as intractable as factorization, MIT Lab. for Computer Science Technical Report LCS/TR-212, 1979.
29. R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (2) (1978), pp. 120-126.
30. R. Sakai, K. Ohgishi, and M. Kasahara, Cryptosystems based on pairings, Proc. 2000 Symposium on Cryptography and Information Security, Okinawa, 2000.
31. A. Shamir, Identity-based cryptosystems and signature schemes, Advances in Cryptology-Crypto'84, LNCS 196, Springer-Verlag, 1985, pp. 277-296.
32. V. Shoup, Lower bounds for discrete logarithms and related problems, Advances in Cryptology- Eurocrypt'97, LNCS 1233, Springer-Verlag, 1997, pp. 256-266.
33. B. Snow, We need assurance!, Proc. 21st Annual Computer Security Applications Conference, IEEE Computer Society, 2005, pp. 3-10.
34. E. Teske, Square-root algorithms for the discrete log problem (a survey), in Public-Key Cryptography and Computational Number Theory, Walter de Gruyter, 2001, pp. 283-301.
35. H. Williams, A modification of the RSA public-key encryption procedure, IEEE Trans. Inf. Theory, IT-26, 1980, pp. 726-729.