Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*

Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views relies on a simple but effective formal approach; the other, on a detailed computational model that considers issues of complexity and probability. There is an uncomfortable and interesting gap between these two approaches to cryptography. This paper starts to bridge the gap, by providing a computational justification for a formal treatment of encryption.

Authors and Affiliations

1. Computer Science Department, University of California at Santa Cruz, Santa Cruz, CA 95064, U.S.A. abadi@cs.ucsc.edu www.soe.ucsc.edu/~abadi/, US

   Martín Abadi

2. Department of Computer Science, University of California at Davis, Davis, CA 95616, U.S.A. rogaway@cs.ucdavis.edu www.cs.ucdavis.edu/~rogaway, US

   Phillip Rogaway

Received July 2000 and revised January 2001 Online publication 19 October 2001

An erratum to this article is available at http://dx.doi.org/10.1007/s00145-007-0203-0.

Reprints and permissions