See this document in CiteSeerX!

I/O Automaton Models and Proofs for Shared-Key Communication Systems (1999)  (Make Corrections)  
Nancy Lynch



  Home/Search   Context   Related

 
View or download:
mit.edu/publicatio...TLCSTR789.ps.gz
mit.edu/tds/papers/...securitytr.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/publications/pubs/ps/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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. (Update)

Similar documents (at the sentence level):
64.6%:   IO Automaton Models and Proofs for Shared-Key Communication Systems - Lynch (1999)   (Correct)
30.7%:   I/O Automaton Models and Proofs for Shared-Key Communication Systems - Lynch   (Correct)

Active bibliography (related documents):   More   All
0.2:   A Convenient Method for Securely Managing Passwords - Halderman, Waters, Felten (2005)   (Correct)
0.2:   The IOA Language and Toolset: Support for Designing.. - Garland, Lynch (1998)   (Correct)
0.1:   Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000)   (Correct)

Similar documents based on text:   More   All
0.3:   Using I/O Automata for Developing Distributed Systems - Garland, Lynch   (Correct)
0.2:   Correctness of Vehicle Control Systems - A Case Study - Weinberg, Lynch (1996)   (Correct)
0.2:   Analyzing a Library of Security Protocols using Casper and FDR - Donovan, Norris, Lowe (1999)   (Correct)

BibTeX entry:   (Update)

@techreport{ lynch99io,
    author = "Nancy Lynch",
    title = "{I/O} Automaton Models and Proofs for Shared-Key Communication Systems",
    number = "MIT/LCS/TR-789",
    address = "Cambridge, MA, USA",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/lynch99io.html" }
Citations (may not include all citations):
854   Information and Computation (context) - Milner, Parrow et al. - 1992
718   Distributed Algorithms (context) - Lynch - 1996
531   The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
428   IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
317   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1993
263   The inductive approach to verifying cryptographic protocols - Paulson - 1998
139   introduction to inputoutput automata (context) - Lynch, An et al. - 1989
130   Provably secure session key distribution - the three party c.. - Bellare, Rogaway - 1995
114   A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell et al. - 1998
89   The Interrogator: Protocol security analysis (context) - Millen, Clark et al. - 1987
86   Specifying and using a partitionable group communication ser.. - Fekete, Lynch et al. - 1997
80   A semantic model for authentication protocols - Woo, Lam - 1993
64   Codes and Cryptography (context) - Diffie, van Oorschot et al. - 1992
51   The Isabelle reference manual - Paulson - 1993
47   Verifying authentication protocols with CSP - Schneider - 1997
47   Analyzing encryption protocols using formal verification tec.. (context) - Kemmerer - 1989
35   Specifications and proofs for Ensemble layers - Hickey, Lynch et al. - 1999
34   Time bounds for real-time process control in the presence of.. - Attiya, Lynch - 1994
30   A system for the specification and analysis of key managemen.. (context) - Meadows - 1991
25   automaton models and proofs for shared-key communication sys.. (context) - Lynch - 1999
19   Secure implementation of channel abstractions - 'in, C'edric et al. - 1998
18   Advances in Cryptology - CRYPTO (context) - Bellare, Rogaway et al. - 1994
18   Implementing sequentially consistent shared objects using br.. - Fekete, Kaashoek et al. - 1998
18   Using simulation techniques to prove timing properties - Luchangco - 1995
13   the Borowsky-Gafni simulation algorithm (context) - Lynch, Rajsbaum - 1996
9   Safe simplifying transformations for security protocols or n.. - Hui, Lowe - 1999
4   Naming state variables of composite automata in IOA (context) - Vaziri - 1998
4   and Roger Needham (context) - 'in, Michael - 1989
2   Tecnica dei vincoli negativi: un nuovo metodo per l'analisi .. (context) - Cavalca - 1997
2   Negative constraints for the analysis of authentication prot.. (context) - Cavalca, Segala
2   A semantics for a logic of authentification (context) - 'in, Mark et al. - 1991
2   Personal communication (context) - Sheyner, Wing - 1999
1   Principles of Computer Systems (context) - Lampson, Shvartsman et al. - 1997

Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/):   More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998)   (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987)   (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC