Cryptographic protocols have so far been analyzed for the most part by means of testing (which does not yield proofs of secrecy) and theorem proving (costly). We propose a new, abstract interpretation based, approach, using regular tree languages. The abstraction we use seems fine-grained enough to be able to certify some protocols. Both the concrete and abstract semantics of the protocol description language and implementation issues are discussed in the paper. This paper is to be published in the proceedings of SAS '99, in Springer-Verlag's Lecture Notes in Computer Science series. The reader is invited to buy the proceedings of the conference. Copyright c
|
965
|
A logic of authentication
– Burrows, Abadi, et al.
- 1989
|
|
762
|
Applied Cryptography
– Schneier
- 1996
|
|
622
|
A calculus for cryptographic protocols: The spi calculus
– Abadi, Gordon
- 1999
|
|
473
|
Breaking and fixing the Needham-Schroeder public-key protocol using FDR
– Lowe
- 1996
|
|
371
|
Non-malleable cryptogra-phy
– Dolev, Dwork, et al.
- 1991
|
|
262
|
Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– Patrick
- 1977
|
|
255
|
Abstract interpretation and application to logic programs
– Cousot, Cousot
- 1992
|
|
227
|
Secrecy by typing in security protocols
– ABADI
- 1997
|
|
216
|
Automated Analysis of Cryptographic Protocols Using Murϕ
– Mitchell, Mitchell, et al.
- 1997
|
|
203
|
The NRL protocol analyzer: An overview
– Meadows
- 1996
|
|
174
|
Provably secure session key distribution – the three party case
– Bellare, Rogaway
- 1995
|
|
173
|
Reasoning about Belief in Cryptographic Protocol Analysis
– Gong, Needham, et al.
- 1990
|
|
145
|
Proving Properties of Security Protocols by Induction
– Paulson
- 1996
|
|
133
|
Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata
– Comon, Dauchet, et al.
- 1997
|
|
132
|
A metanotation for protocol analysis
– Cervesato, Durgin, et al.
- 1999
|
|
94
|
Oorschot, “On Unifying Some Cryptographic Protocol Logics
– Syverson, van
- 1994
|
|
82
|
Towards a completeness result for model checking security protocols
– Lowe
- 1999
|
|
80
|
On the reachability problem in cryptographic protocols
– Amadio, Lugiez
|
|
79
|
Fail-stop protocols: An approach to designing secure protocols, Dependable Computing for Critical Applications 5
– Gong, Syverson
- 1998
|
|
60
|
Model checking for security protocols
– Marrero, Clarke, et al.
- 1997
|
|
56
|
Using CSP to detect errors in the TMN protocol
– Roscoe, Lowe
- 1997
|
|
55
|
Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique de programmes., Université scientifique et médicale de
– Cousot
|
|
54
|
Secrecy Types for Asymmetric Communication
– Abadi, Blanchet
- 2003
|
|
52
|
Reasoning about cryptographic protocols in the spi calculus
– Abadi, Gordon
- 1997
|
|
51
|
Athena: a new efficient automatic checker for security protocol analysis
– Song
- 1999
|
|
46
|
Adding Time to a Logic of Authentication
– Syverson
- 1993
|
|
45
|
CAPSL: Common Authentication Protocol Specification Language
– Millen
- 1997
|
|
43
|
Rewriting for cryptographic protocol verification
– Genet, Klay
- 2000
|
|
42
|
A method for automatic cryptographic protocol verification (extended abstract
– Goubault-Larrecq
- 2000
|
|
32
|
Decidable approximations of sets of descendants and sets of normal forms
– Genet
- 1998
|
|
27
|
Solving systems of set constraints (extended abstract
– Aiken, Wimmers
- 1992
|
|
24
|
automatic checking of security protocols
– Fast
- 1996
|
|
23
|
The interrogator: A tool for cryptographic protocol security
– Millen
- 1984
|
|
17
|
Cryptographic Protocols for Distributed Systems
– Gong
- 1990
|
|
13
|
Automatic Verification of Cryptographic Protocols with Setheo
– Schumann
- 1997
|
|
12
|
Towards a strand semantics for authentication logic
– Syverson
- 1999
|
|
11
|
Athena: a New Ecient Automatic Checker for Security Protocol Analysis
– Song
- 1999
|
|
8
|
Representation of Sets of Trees for Abstract Interpretation
– Mauborgne
- 1999
|
|
7
|
Decision procedures for the analysis of cryptographic protocols by logics of belief
– Monniaux
- 1999
|
|
5
|
Using EVES to analyze authentication protocols
– Craigen, Saaltink
- 1996
|
|
2
|
a simple language for cryptographic protocols. available on the WWW
– Clap
- 1999
|
|
1
|
BANE: Analysis Programmer Interface
– Fahndrich
- 1998
|
|
1
|
DNS overview with a discussion of DNS spoofing. http://www.sans.org/infosecFAQ/DNS/DNS.htm
– Hanley
|
|
1
|
MONA version 1.3
– Klarlund, Mller
- 1998
|
|
