Abstract
We develop a typed process calculus for security protocols in which types convey secrecy properties. We focus on asymmetric communication primitives, especially on public-key encryption. These present special difficulties, partly because they rely on related capabilities (e.g., “public” and “private” keys) with different levels of secrecy and scopes.
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. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749–786, September 1999.
Martín Abadi. Security protocols and their properties. In F.L. Bauer and R. Steinbrueggen, editors, Foundations of Secure Computation, NATO Science Series, pages 39–60. IOS Press, 2000. Volume for the 20th International Summer School on Foundations of Secure Computation, held in Marktoberdorf, Germany (1999).
Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1–70, January 1999. An extended version appeared as Digital Equipment Corporation Systems Research Center report No. 149, January 1998.
Martín Abadi and Roger Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1):6–15, January 1996.
Ross Anderson and Roger Needham. Robustness principles for public key protocols. In Proceedings of Crypto’ 95, pages 236–247, 1995.
Andrew Birrell, Greg Nelson, Susan Owicki, and Edward Wobber. Network objects. Software Practice and Experience, S4(25):87–130, December 1995.
Chiara Bodei. Security Issues in Process Calculi. PhD thesis, Università di Pisa, January 2000.
Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Control flow analysis for theπ-calculus. In CONCUR’98: Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 84–98. Springer Verlag, September 1998.
Luca Cardelli, Giorgio Ghelli, and Andrew D. Gordon. Secrecy and group creation. In Catuscia Palamidessi, editor, CONCUR 2000: Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 365–379. Springer-Verlag, August 2000.
Dorothy E. Denning. Cryptography and Data Security. Addison-Wesley, Reading, Mass., 1982.
Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372–385, January 1996.
Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270–299, April 1984.
Nevin Heintze and Jon G. Riecke. The SLam calculus: programming with secrecy and integrity. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages, pages 365–377, 1998.
Matthew Hennessy and James Riely. Information flow vs. resource access in the asynchronous pi-calculus. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, pages 415–427. Springer-Verlag, 2000.
Kohei Honda, Vasco Vasconcelos, and Nobuko Yoshida. Secure information flow as typed process behaviour. In Gert Smolka, editor, Programming Languages and Systems: Proceedings of the 9th European Symposium on Programming (ESOP 2000), Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS 2000), volume 1782 of Lecture Notes in Computer Science, pages 180–199. Springer-Verlag, 2000.
K. Rustan M. Leino and Rajeev Joshi. A semantic approach to secure information flow. In Mathematics of Program Construction, 4th International Conference, volume 1422 of Lecture Notes in Computer Science, pages 254–271. Springer Verlag, 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.
Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
Massimo Merro and Davide Sangiorgi. On asynchrony in name-passing calculi. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 856–867. Springer-Verlag, 1998.
Jon Millen and Harald Ruess. Protocol-independent secrecy. In Proceedings 2000 IEEE Symposium on Security and Privacy, pages 110–119, May 2000.
Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, parts I and II. Information and Computation, 100:1–40 and 41-77, September 1992.
Andrew C. Myers. JFlow: Practical mostly-static information flow control. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 228–241, January 1999.
Andrew C. Myers and Barbara Liskov. A decentralized model for information flow control. In Proceedings of the 16th ACM Symposium on Operating System Principles, pages 129–142, 1997.
Roger M. Needham and Michael D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993–999, December 1978.
L. C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1-2):85–128, 1998.
Fran-cois Pottier and Sylvain Conchon. Information flow inference for free. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP’00), pages 46–57, September 2000.
James Riely and Matthew Hennessy. Trust and partial typing in open systems of mobile agents. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 93–104, January 1999.
Dennis Volpano, Cynthia Irvine, and Geoffrey Smith. A sound type system for secure flow analysis. Journal of Computer Security, 4:167–187, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, M., Blanchet, B. (2001). Secrecy Types for Asymmetric Communication. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive