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 Di e-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. 0 

• Type: Conference
• Year: 1999
• Where: CSFW
• Authors: Nancy A. Lynch
• Keywords: CSFW 1999, Key Distribution Protocol, Security Privacy, Security Protocols, Shared-key Communication Protocol