(Enter summary)
Abstract: The spi calculus is an extension of the pi calculus with cryptographic primitives, designed
for the verification of cryptographic protocols. Due to the extension, the naive adaptation
of labeled bisimulations for the pi calculus is too strong to be useful for the purpose of verification.
Instead, as a viable alternative, several "environment-sensitive" bisimulations have
been proposed. In this paper we formally study the di#erences between these bisimulations.
1 (Update)
Cited by: More
Complete Lax Logical Relations for Cryptographic.. - Goubault-Larrecq.. (2004)
(Correct)
On Bisimulations for the Spi Calculus - Johannes Borgstrom Epfl (2002)
(Correct)
A Bisimulation for Dynamic Sealing - Sumii, Pierce (2004)
(Correct)
Active bibliography (related documents): More All
0.0: Process Calculi and the Verification of Security Protocols - Boreale, Gorla (2002)
(Correct)
0.0: Observational equivalence and trace equivalence in an extension.. - Cortier (2002)
(Correct)
0.0: Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000)
(Correct)
Similar documents based on text: More All
0.5: Deciding Framed Bisimilarity - Hüttel (2002)
(Correct)
0.4: A Logical ramework for the spi-calculus - Montanari, Tuosto
(Correct)
0.4: A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1997)
(Correct)
Related documents from co-citation: More All
8: Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 1999
6: A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
6: A Bisimulation Method for Cryptographic Protocols
- Abadi, Gordon - 1998
BibTeX entry: (Update)
J. Borgstrom and U. Nestmann. On Bisimulation in the Spi Calculus. Draft full version, available from http://lamp.epfl.ch/uwe/doc/spi/, 2002. http://citeseer.ist.psu.edu/672631.html More
@misc{ borgstrom02bisimulation,
author = "J. Borgstrom and U. Nestmann",
title = "On Bisimulation in the Spi Calculus",
text = "J. Borgstrom and U. Nestmann. On Bisimulation in the Spi Calculus. Draft
full version, available from http://lamp.epfl.ch/uwe/doc/spi/, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/672631.html" }
Citations (may not include all citations):
502
Concurrency and automata on infinite sequences (context) - Park - 1981
404
A calculus for cryptographic protocols: The Spi calculus
- Abadi, Gordon - 1999
317
IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
197
Barbed bisimulation
- Milner, Sangiorgi - 1992
178
Communicating and Mobile Systems: the #-Calculus (context) - Milner - 1999
59
A bisimulation method for cryptographic protocols
- Abadi, Gordon - 1998
44
Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 2002
44
Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 1999
41
i and Cedric Fournet. Mobile values, new names, and secure c.. (context) - Abad - 2001
6
On Bisimulations for the Spi-Calculus
- Borgstrom - 2001
1
Deciding framed bisimilarity
- Huttel - 2002
1
Observational equivalence and trace equivalence in an extens..
- Cortier - 2002
1
Towards automatic bisimilarity checking in the spi calculus
- Elkjr, Hohle et al. - 1999
1
Two notions of environment sensitive bisimilarity for spi-ca.. (context) - Frendrup, Huttel et al. - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://lamp.epfl.ch/~jobo/):
On Bisimulations for the Spi Calculus - Johannes Borgstrom And (2002)
(Correct)
Process Calculi for the Foundations of - Peer-To-Peer Systems Johannes
(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