Notes - Burdens of Proof - page 220

ogy ePrint Archive, Report 2006/461, available at http://eprint.iacr.org/2006/461
(accessed June 4, 2011); Neal Koblitz and Alfred J. Menezes, “Another Look at 'Prov-
able Security' II,” in Progress in Cryptology—Indocrypt 2006 , ed. Rana Barua and Tanja
Lange (Berlin: Springer, 2006), 148-175; Douglas R. Stinson, “Some Observations on
the Theory of Cryptographic Hash Functions,” Designs, Codes and Cryptography 38,
no. 2 (2006): 259-277; Ivan Damgård, “A 'Proof-Reading' of Some Issues in Cryp-
tography,” in Automata, Languages and Programming (Berlin: Springer-Verlag, 2007),
2-11; and, most recently, Neil Koblitz and Alfred J. Menezes, “The Brave New World
of Bodacious Assumptions in Cryptography,” Notices of the American Mathematical
Society 57 (2010): 357-365. A selection of unpublished letters to the editor of the
Notices of the American Mathematical Society written in response to Koblitz and
Menezes is available at Oded Goldreich's website: http://www.wisdom.weizmann
.ac.il/~oded/on-pmc.html.
7. Diffie and Hellman, “New Directions in Cryptography,” 653-654.
8. Mihir Bellare, “Practice-Oriented Provable-Security,” in Lectures on Data Security:
Modern Cryptology in Theory and Practice , ed. Ivan Damgård (Berlin: Springer, 1999),
4. Indeed, the title of the keynote address at CRYPTO 2010 pondered “Is Theoretical
Cryptography Any Good in Practice?”
9. Mihir Bellare and Phil Rogaway, “Random Oracles Are Practical: A Paradigm for
Designing Efficient Protocols,” in Proceedings of the 1st ACM Conference on Computer
and Communications Security , Fairfax, VA, November 3-5, 1993, 63.
10. RSA Laboratories, “How Fast Is the RSA Algorithm?,” http://www.rsa.com/
rsalabs/node.asp?id=2215 (accessed June 25, 2011).
11. Bellare, “Practice-Oriented Provable-Security,” 4.
12. Menezes, van Oorschot, and Vanstone, Handbook of Applied Cryptography , 33.
13. As Papadimitriou notes, “By definition, cryptography involves two communi-
cating agents, who may have different and conflicting priorities and interests. Fur-
thermore, and more importantly, they communicate in the presence of eavesdroppers
with even murkier motives. In this sense, even the simple situation . . . [with] Alice,
Bob and Eve is something more complex than solving a computational problem,
where the only goal is to achieve low complexity. It is a protocol , that is, a set of
interacting computations, sharing inputs and outputs in arbitrarily complex ways.
Furthermore, some of these computations are prescribed to be easy, and for some it
is desired to be hard .” Papadimitriou, Computational Complexity , 287-288.
14. Bellare, “Practice-Oriented Provable-Security,” 4.
15. Phillip Rogaway, “On the Role of Definitions In and Beyond Cryptography,” in
Advances in Computer Science—ASIAN 2004 , ed. Michael J. Maher (Berlin: Springer,
2005), 18.