Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Martýn Abadi. Protection in programming-language translations. In Proceedings of the 25th International Colloquium on Automata,Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 868–883. Springer-Verlag, July 1998. Also Digital Equipment Corporation Systems Research Center report No. 154, April 1998.
Martýn Abadi, Cédric Fournet, and Georges Gonthier. Secure implementation of channel abstractions. In Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, pages 105–116, June 1998.
Martýn Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The Spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36–47, 1997.
Martýn Abadi and Andrew D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5(4):267–303, Winter 1998.
Martýn Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1–70, January1999. An extended version appeared as Digital Equipment Corporation Systems Research Center report No. 149, January 1998.
Mihir Bellare, Alexandra Boldyreva, Anand Desai, and David Pointcheval. Anonymous encryption. Unpublished manuscript, 2000.
Mihir Bellare, Anand Desai, Eron Jokipii, and Phillip Rogaway. A concrete security treatment of symmetric encryption: analysis of the DES modes of operation. In Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), 1997.
Mihir Bellare, Joe Kilian, and Phillip Rogaway. The security of cipher block chaining. In Advances in Cryptology—CRYPTO ’94, volume 839of Lecture Notes in Computer Science, pages 341–358. Springer-Verlag, 1994. To appear in Journal of Computer and System Sciences.
Mihir Bellare and Phillip Rogaway. Entity authentication and key distribution. In Advances in Cryptology-CRYPTO ’94, volume 773 of Lecture Notes in Computer Science, pages 232–249. Springer-Verlag, 1993.
Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62–73, 1993.
Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo random bits. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 82), pages 112–117, 1982.
Michele Boreale, Rocco De Nicola, and Rosario Pugliese. Proof techniques for cryptographic processes. In Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science, pages 157–166, July 1999.
Michael Burrows, Martýn Abadi, and Roger Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233–271, 1989. A preliminary version appeared as Digital Equipment Corporation Systems Research Center report No. 39, February 1989.
Richard A. DeMillo, Nancy A. Lynch, and Michael Merritt. Cryptographic protocols. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 1982.
Danny Dolev and Andrew C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12):198–208, March 1983.
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 218–229, 1987.
Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity or All languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):691–729, 1991.
Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270–299, April 1984.
Shafi Goldwasser, Silvio Micali, and Ronald Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal on Computing, 17:281–308, 1988.
James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols—exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45–58, 1997.
James W. Gray, III and John McLean. Using temporal logic to specify and verify cryptographic protocols (progress report). In Proceedings of the 8th IEEE Computer Security Foundations Workshop, pages 108–116, 1995.
R. Kemmerer, C. Meadows, and J. Millen. Three system for cryptographic protocol analysis. Journal of Cryptology, 7(2):79–130, Spring 1994.
Richard A. Kemmerer. Analyzing encryption protocols using formal verification techniques. IEEE Journal on Selected Areas in Communications, 7(4):448–457, May 1989.
P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In Proceedings of the Fifth ACM Conference on Computer and Communications Security, pages 112–121, 1998.
Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 147–166. Springer Verlag, 1996.
Nancy Lynch. I/O automaton models and proofs for shared-key communication systems. In Proceedings of the 12th IEEE Computer Security Foundations Workshop, pages 14–29, 1999.
Catherine Meadows. A system for the specification and analysis of key management protocols. In Proceedings of the 1991 IEEE Symposium on Research in Security and Privacy, pages 182–195, 1991.
Jonathan K. Millen, Sidney C. Clark, and Sheryl B. Freedman. The Interrogator: Protocol security analysis. IEEE Transactions on Software Engineering, SE-13(2): 274–288, February 1987.
John C. Mitchell, Mark Mitchell, and Ulrich Stern. Automated analysis of cryptographic protocols using Murφ. In Proceedings of the 1997 IEEE Symposium on Security and Privacy, pages 141–151, 1997.
Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1–2):85–128, 1998.
Birgit Pfitzmann, Matthias Schunter, and Michael Waidner. Cryptographic security of reactive systems (extended abstract). Electronic Notes in Theoretical Computer Science, 32, April 2000.
Steve Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174–187, 1996.
Paul F. Syverson and Paul C. van Oorschot. On unifying some cryptographic protocol logics. In IEEE Computer Society Symposium on Research in Security and Privacy, pages 14–28, 1994.
F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Why is a security protocol correct? In Proceedings 1998 IEEE Symposium on Security and Privacy, pages 160–171, May 1998.
Dennis Volpano and Geoffrey Smith. Verifying secrets and relative secrecy. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages, pages 268–276, 2000.
David Wagner. Re: Security of DES key encrypted with its self???? On the Web at http://www.cs.berkeley.edu/daw/my-posts/key-as-iv-broken-again, 1996.
Andrew C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 82), pages 80–91, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, M., Rogaway, P. (2000). Reconciling Two Views of Cryptography. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive