Sciweavers

Share
CSFW
1999
IEEE

I/O Automaton Models and Proofs for Shared-Key Communication Systems

9 years 8 months ago
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
Nancy A. Lynch
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 1999
Where CSFW
Authors Nancy A. Lynch
Comments (0)
books