I/O automaton models and proofs for shared-key communication systems

The combination of two security protocols, a simple shared-key communication protocol and the Diffie-Hellman key distribution protocol, is modeled formally and proved correct. The modeling is based on the I/O automaton model for distributed algorithms, and the proofs are based on invariant assertions, simulation relations, and compositional reasoning. Arguments about the cryptosystems are handled separately from arguments about the protocols.

[1]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[2]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[4]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[5]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[6]  Richard A. Kemmerer,et al.  Analyzing encryption protocols using formal verification techniques , 1989, IEEE J. Sel. Areas Commun..

[7]  Catherine A. Meadows,et al.  A system for the specification and analysis of key management protocols , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[8]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  Paul C. van Oorschot,et al.  Authentication and authenticated key exchanges , 1992, Des. Codes Cryptogr..

[10]  Simon S. Lamt A Semantic Model for Authentication , 1993 .

[11]  Simon S. Lam,et al.  A semantic model for authentication protocols , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.

[12]  Mihir Bellare,et al.  Entity Authentication and Key Distribution , 1993, CRYPTO.

[13]  Nancy A. Lynch,et al.  Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty , 1994, Inf. Comput..

[14]  R. Bol,et al.  Loop Checking and Negation , 1990, J. Log. Program..

[15]  Nancy A. Lynch,et al.  Implementing sequentially consistent shared objects using broadcast and point-to-point communication , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[16]  Victor Luchangco,et al.  Using simulation techniques to prove timing properties , 1995 .

[17]  Paul Pettersson,et al.  Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II , 1998, TACAS.

[18]  Mihir Bellare,et al.  Provably secure session key distribution: the three party case , 1995, STOC '95.

[19]  Nancy A. Lynch,et al.  On the Borowsky-Gafni simulation algorithm , 1996, PODC '96.

[20]  Nancy A. Lynch,et al.  Computer-Assisted Verification of an Algorithm for Concurrent Timestamps , 1996, FORTE.

[21]  Nancy A. Lynch,et al.  Specifying and using a partitionable group communication service , 1997, PODC '97.

[22]  John C. Mitchell,et al.  A probabilistic poly-time framework for protocol analysis , 1998, CCS '98.

[23]  Nancy A. Lynch,et al.  Implementing sequentially consistent shared objects using broadcast and point-to-point communication , 1998, JACM.

[24]  Martín Abadi,et al.  Protection in Programming-Language Translations , 1998, ICALP.

[25]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

[26]  Steve A. Schneider Verifying Authentication Protocols in CSP , 1998, IEEE Trans. Software Eng..

[27]  Gavin Lowe,et al.  Safe simplifying transformations for security protocols or not just the Needham Schroeder pubic key protocol , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[28]  Martín Abadi Protection in Programming-Language Translations , 1999, Secure Internet Programming.

[29]  Gavin Lowe,et al.  Safe Simplifying Transformations for Security Protocols. , 1999 .

[30]  Nancy A. Lynch,et al.  Specifications and Proofs for Ensemble Layers , 1999, TACAS.

[31]  Nancy A. Lynch,et al.  Specifying and using a partitionable group communication service , 2001, TOCS.