(Enter summary)
Abstract: Properties of security protocols such as authentication and secrecy are often verified by explictly generating an operational model of the protocol and then seeking for insecure states. However, message exchange between the intruder and the honest participants induces a form of state explosion that makes the model infinite in principle. Building on previous work on symbolic semantics, we propose a general framework for automatic analysis of security protocols that make use of a variety of... (Update)
Context of citations to this paper: More
...and no explicit description of the adversary must be provided. The theory underlying STA is developed and explained in full detail in [4, 5]. In the present paper, we mainly intend to illustrate the use of STA and the significance of the above listed features in practice. To do...
Cited by: More
A Method for Symbolic Analysis of Security Protocols - Boreale, Buscemi
(Correct)
Symbolic Analysis of Crypto-Protocols Based on Modular.. - Boreale, Buscemi (2003)
(Correct)
Profundis: - Periodic Progress Report
(Correct)
Similar documents (at the sentence level):
7.8%: Symbolic Trace Analysis of Cryptographic Protocols - Boreale
(Correct)
Active bibliography (related documents): More All
0.6: Experimenting with STA, a tool for automatic analysis of.. - Boreale, Buscemi
(Correct)
0.4: Process Calculi and the Verification of Security Protocols - Boreale, Gorla (2002)
(Correct)
0.3: Symbolic Analysis of Cryptographic Protocols in the Spi-Calculus - Boreale (2000)
(Correct)
Similar documents based on text: More All
0.4: Proof Techniques for Cryptographic Processes - Boreale, De Nicola, Pugliese (1999)
(Correct)
0.4: Process Algebraic Analysis Of Cryptographic Protocols - Boreale, De Nicola, Pugliese (2000)
(Correct)
0.4: D-Fusion: a Distinctive Fusion Calculus - Boreale, Buscemi, Montanari
(Correct)
Related documents from co-citation: More All
3: Symbolic trace analysis of cryptographic protocols in the spicalculus
- Boreale
3: IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
3: Breaking and fixing the Needham-Schroeder public-key protocol using FDR
- Lowe - 1996
BibTeX entry: (Update)
M. Boreale, M. Buscemi. A framework for the analysis of security protocols. Submitted. An abstract appears in Proc. of WSDAAL 2001, Como, Italy. http://citeseer.ist.psu.edu/boreale01framework.html More
@misc{ boreale01framework,
author = "M. Boreale and M. Buscemi",
title = "A framework for the analysis of security protocols",
note = "An abstract appears in Proc. of {WSDAAL} 2001, Como, Italy.",
year = "2001",
url = "citeseer.ist.psu.edu/boreale01framework.html" }
Citations (may not include all citations):
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1999
322
Breaking and Fixing the Needham-Schroeder Public-Key Protoco..
- Lowe - 1996
317
IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
263
The inductive approach to verifying cryptographic protocols
- Paulson - 1998
184
Automated Analysis of Cryptographic Protocols Using Mur
- Mitchell, Mitchell et al. - 1997
71
Undecidability of bounded security protocols
- Durgin, Lincoln et al. - 1999
70
Verifying Authentication Protocols in CSP (context) - Schneider - 1998
59
Proving security protocols with model checkers by data indep..
- Roscoe - 1998
57
Model checking for security protocols
- Marrero, Clarke et al. - 1997
54
Using State Space Exploration and a Natural Deduction Style ..
- Clarke, Jha et al. - 1998
50
the reachability problem in cryptographic protocols
- Amadio, Lugiez - 2000
47
Constraint solving for bounded-process cryptographic protoco..
- Millen, Shmatikov - 2001
44
Proof Techniques for Cryptographic Processes
- Boreale, De Nicola et al. - 1999
35
Protocol Insecurity with Finite Number of Sessions in NP-Com..
- Rusinowitch, Turuani - 2001
33
Analyzing Security Protocols with Secrecy Types and Logic Pr..
- Abadi, Blanchet - 2002
32
Symbolic Trace Analysis of Cryptographic Protocols
- Boreale - 2001
31
Tree automata with one memory (context) - Comon, Cortier et al. - 2001
30
Computing Symbolic Models for Verifying Cryptographic Protoc..
- Fiore, Abadi - 2001
19
the symbolic reduction of processes with cryptographic funct.. (context) - Amadio, Lugiez et al. - 2001
16
A Hierarchy of Authentication Speci cations
- Lowe - 1997
8
How to prevent type aw attacks on security protocols (context) - Heather, Lowe et al. - 2000
7
Ecient in nite-state analysis of security protocols (context) - Huima - 1999
7
and Secure Communication (context) - Abadi, Fournet et al. - 2001
6
Modelling and verifying key-exchange using CSP and FDR (context) - Roscoe - 1995
6
The game of the name in cryptographic tables
- Amadio, Prasad - 2000
4
a Tool for Automatic Analysis of Security Protocols (context) - Boreale, Buscemi et al. - 2002
2
ML object code and examples (context) - for, of et al. - 2001
Documents on the same site (http://music.dsi.unifi.it/papers.html): More
Linda based Applicative and Imperative Process Algebras - De Nicola, Pugliese
(Correct)
Divergence in Testing and Readiness Semantics - Boreale, De Nicola, Pugliese
(Correct)
A Modal Logic for Mobile Agents - De Nicola, Loreti
(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