See this document in CiteSeerX!

An Isabelle formalization of protocol-independent secrecy with an application to e-commerce (2002)  (Make Corrections)  
Frederic Blanqui



  Home/Search   Context   Related

 
View or download:
loria.fr/~blanqui/papers/isa02.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  loria.fr/~blanqui/papers (more)
(Enter author homepages)

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

Abstract: A protocol-independent secrecy theorem is established and applied to several non-trivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of free-roaming mobile agents doing comparison shopping. All the results presented here have been formally proved in Isabelle by building on Larry Paulson's inductive approach. This therefore provides a library of general theorems that can be applied to other protocols. (Update)

Similar documents based on text:   More   All
0.3:   Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2003)   (Correct)
0.3:   An Isabelle formalization of protocol-independent secrecy with an .. - Blanqui   (Correct)
0.2:   A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ blanqui-isabelle,
  author = "Frederic Blanqui",
  title = "An Isabelle formalization of protocol-independent secrecy with an application
    to e-commerce",
  url = "citeseer.ist.psu.edu/blanqui02isabelle.html" }
Citations (may not include all citations):
450   Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
302   A logic of authentication - Abadi, Burrows et al. - 1990
263   The inductive approach to verifying cryptographic protocols - Paulson - 1998
93   An attack on the Needham-Schroeder public-key authentication.. - Lowe - 1995
75   Towards a completeness result for model checking of security.. - Lowe - 1998
71   Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
69   IsabelleHOL Proof Assistant Higher Order Logic (context) - Paulson, HOL et al. - 2002
48   A sanctuary for mobile agents - Yee - 1998
47   Inductive analysis of the internet protocol TLS - Paulson - 1999
42   Strand spaces: Why is a security protocol correct (context) - Guttman, Herzog et al. - 1998
39   Kerberos version IV: inductive analysis of the secrecy goals - Bella, Paulson - 1998
28   The faithfulness of abstract protocol analysis: message auth.. (context) - Guttman, Thayer et al. - 2001
28   Protecting the computation results of free-roaming agents (context) - Asokan, ulc et al. - 1998
23   Protocol-independent secrecy - Millen, Rue - 2000
21   Relations between secrets: two formal analyses of the Yahalo.. - Paulson - 2001

[Article contains additional citations not shown here]

Documents on the same site (http://www.loria.fr/~blanqui/papers.html):   More
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004)   (Correct)
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003)   (Correct)
Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2005)   (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