(Enter summary)
Abstract: The spi calculus by Abadi and Gordon, an extension of Robin Milner's ß-calculus, is designed to model cryptographic protocols. Classic security properties are easily expressed in spi using the notion of testing equivalence by De Nicola and Hennessy. However, proving processes testing equivalent is a daunting task. Thus framed bisimilarity, a bisimulation method implying testing equivalence, has been proposed by Abadi and Gordon. Unfortunately this method is immediately not suited for... (Update)
Cited by: More
On Bisimulations for the Spi Calculus - Johannes Borgstrom Epfl (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Symbolic Bisimulations and Proof Systems for the pi-Calculus - Lin (1994)
(Correct)
0.1: The Spi-Calculus and a Bisimulation Method - Raymond (1999)
(Correct)
0.0: Formal Verification of Cryptographic Protocols using.. - Gnesi, Latella, Lenzini
(Correct)
Similar documents based on text: More All
1.0: Deciding Framed Bisimilarity - Hüttel (2002)
(Correct)
1.0: A "Brutus" model checking of a spi-calculus dialect (Extended.. - Gnesi, al. (2000)
(Correct)
0.8: Strong Bisimilarity Can Be Opened - Andersen, Hüttel, Jensen (2002)
(Correct)
Related documents from co-citation: More All
2: Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 1999
BibTeX entry: (Update)
Anders Strandlv Elkjr, Micheal Hohle, Hans Huttel, and Kasper Overgard. Towards automatic bisimilarity checking in the spi calculus. In C. S. Calude and M. J. Dinneen, editors, Combinatorics, Computation & Logic, volume 21(3) of Australian Computer Science Communications, pages 175--189. Springer-Verlag Singapore Pte. Ltd., January 1999. http://citeseer.ist.psu.edu/232308.html More
@misc{ elkjaer99towards,
author = "A. Elkjær and M. Höhle and H. Hüttel and K. Nielsen",
title = "Towards automatic bisimilarity checking in the Spi calculus",
text = "A. Elkjær, M. Höhle, H. Hüttel, and K. Nielsen. Towards automatic bisimilarity
checking in the Spi calculus. In Proc. of DMTCS 99 and CATS 99, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/232308.html" }
Citations (may not include all citations):
704
Applied Cryptography (context) - Schneier - 1996 ACM
502
Concurrency and automata on infinite sequences (context) - Park - 1981 ACM DBLP
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997 DBLP
404
A Calculus for Cryptographic Protocols: The Spi Calculus
- Abadi, Gordon - 1998 DBLP
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993 ACM
184
Automated analysis of cryptographic protocols using mur
- Mitchell, Mitchell et al. - 1997
168
Testing equivalence for processes (context) - De Nicola, Hennessy - 1983 ACM DBLP
59
A bisimulation method for cryptographic protocols
- Abadi, Gordon ACM DBLP
59
A bisimulation method for cryptographic protocols
- Abadi, Gordon - 1998 ACM DBLP
48
Reasoning about cryptographic protocols in the spi calculus
- Abadi, Gordon - 1997 ACM DBLP
13
Lecture Notes in Computer Science (context) - Anderson, Needham et al. - 1995
2
A symbolic semantics for the ß-calculus (context) - Boreale, De Nicola - 1994
1
Syntax Research Center (context) - Burrow, 'in et al. - 1989
1
Prentice Hall Europe (context) - Milner, Concurrency - 1989
1
Symbolic bisimulation and proof systems for the ß-calculus (context) - Lin - 1994
Documents on the same site (http://www.cs.auc.dk/~hans/Publications/pubs.html): More
Undecidable Equivalences for Basic Parallel Processes - Hüttel (1993)
(Correct)
The Complexity of Deciding Behavioural Equivalences and Preorders - Hüttel, Shukla
(Correct)
Relating Semantic Models for the Object Calculus - Aceto, Hüttel.. (1997)
(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