See this document in CiteSeerX!

Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols  (Make Corrections)  
Giorgio Delzanno, Sandro Etalle



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cs.utwente.nl/~etalle/...de02lopstr.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wwwhome.cs.utwente.nl/~pie...DIES (more)
(Enter author homepages)

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

Abstract: In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete... (Update)

Similar documents (at the sentence level):
10.1%:   Transforming a Proof System into Prolog for Verifying.. - Delzanno, Etalle   (Correct)
6.7%:   An Improved Constraint-Based System for the Verification of.. - Corin, Etalle (2002)   (Correct)

Active bibliography (related documents):   More   All
0.5:   A Tool for Lazy Verification of Security Protocols - Chevalier, Vigneron (2001)   (Correct)
0.3:   Random polynomial-time attacks and Dolev-Yao models - Baudet (2004)   (Correct)
0.3:   Three variations on the analysis of the.. - Michel, Jacquemard.. (2004)   (Correct)

Similar documents based on text:   More   All
0.6:   Using Trace Formulae for Security Protocol Design - Corin, Durante, Etalle, Hartel   (Correct)
0.5:   Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)   (Correct)
0.5:   Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ delzanno-proof,
  author = "Giorgio Delzanno and Sandro Etalle",
  title = "Proof Theory, Transformations, and Logic Programming for Debugging Security
    Protocols",
  url = "citeseer.ist.psu.edu/536105.html" }
Citations (may not include all citations):
450   Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978  ACM   DBLP
322   Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996  ACM   DBLP
302   A logic of authentication - Burrows, Abadi et al. - 1990
263   The inductive approach to verifying cryptographic protocols - Paulson - 1998  ACM   DBLP
195   The Theory and Practice of Concurrency (context) - Roscoe - 1999
184   Automated analysis of cryptographic protocols using mur - Mitchell, Mitchell et al. - 1997
134   The NRL protocol analyzer: An overview - Meadows - 1996  DBLP
110   Casper: A compiler for the analysis of security protocols - Lowe - 1997
104   A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999  ACM   DBLP
99   Modelling and verifying key-exchange protocols using csp and.. - Roscoe - 1995
97   the security of public key protocols (context) - Dolev, Yao - 1983
89   The Interrogator: Protocol security analysis (context) - Millen, Clark et al. - 1987
75   Towards a completeness result for model checking of security.. - Lowe - 1998  ACM   DBLP
71   Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
53   Formal verification of cryptographic protocols: A survey - Meadows - 1995  DBLP
47   Constraint solving for bounded-process cryptographic protoco.. - Millen, Shmatikov - 2001
42   Relating strands and multiset rewriting for security protoco.. - Cervesato, Durgin et al. - 2000  ACM   DBLP
39   Kerberos version IV: Inductive analysis of the secrecy goals - Bella, Paulson - 1998
35   Protocol insecurity with finite number of sessions is np-com.. - Rusinowitch, Turuani - 2001  ACM   DBLP
33   Analyzing Security Protocols with Secrecy Types and Logic Pr.. - Abadi, Blanchet - 2002  ACM   DBLP
19   Mechanized proofs of security protocols: Needham-Schroeder w.. - Paulson - 1997
15   Compiling and verifying security protocols - Jacquemard, Rusinowitch et al. - 2000  DBLP
10   Lazy infinite-state analysis of security protocols - Basin - 1999  ACM   DBLP
9   cient cryptographic protocol verifier based on prolog rules (context) - Blanchet - 2001
7   Specifying and debugging security protocols via hereditary h.. (context) - Delzanno - 2001
6   Verifying security protocols as planning in logic programmin.. (context) - Aiello, Massacci - 2001  ACM   DBLP
5   cient infinite-state analysis of security protocols (context) - Huima - 1999
3   A tool for lazy verification of security protocols - Chevalier, Vigneron - 2001  ACM   DBLP
2   cient automated verification of security protocols (context) - Chevalier, Vigneron - 2001
http://www.loria.fr/equipes/protheo/SOFTWARES/CASRUL/

Documents on the same site (http://wwwhome.cs.utwente.nl/~pieter/refs/DIES.html):   More
Unification-free Prolog programs revisited - Etalle (1996)   (Correct)
The Functional "C" Experience - Hartel, Muller, Glaser (2002)   (Correct)
The Lazy Functional Side of Logic Programming - Etalle, Mountjoy (2000)   (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