A Calculus for Cryptographic Protocols: The Spi Calculus

Abadi, Martı́n; Gordon, Andrew D.

doi:10.1006/inco.1998.2740

Cited by 744 publications

(872 citation statements)

References 17 publications

Supporting

Mentioning

866

Contrasting

Unclassified

Order By: Relevance

“…[3]). For this reason, we keep this section relatively technical apart from stating an outline of the long and complex proof of the full abstraction result.…”

Section: Full Abstractionmentioning

confidence: 99%

“…The applied π-calculus, the spi calculus [3], Burrows, Abadi and Needham's logic of authentication [9], which is nowadays known as BAN logic, and a number of other modelling and analysis techniques for security protocols rest on the Dolev-Yao assumption [11]. This means that the underlying crypto-system is considered unbreakable, so that the protocol logic on top of that is the only concern.…”

Section: Related Workmentioning

confidence: 99%

“…In this the calculus resembles a high level parallel programming language, and specifications of security protocols can be made in a familiar operational style. It can be seen as a generalisation of the spi-calculus [3] (which extends π with primitives for encryption and decryption) in that arbitrary constructors and destructors are allowed. It can also be seen as a simplification of the applied π-calculus by Abadi and Fournet [1], since it does not admit equations over the data terms.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fully Abstract Encoding of the π-Calculus with Data Terms

Baldamus

Parrow

Victor

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. The π-calculus with data terms (πT) extends the pure π-calculus by data constructors and destructors and allows data to be transmitted between agents. It has long been known how to encode such data types in π, but until now it has been open how to make the encoding fully abstract, meaning that two encodings (in π) are semantically equivalent precisely when the original πT agents are semantically equivalent. We present a new type of encoding and prove it to be fully abstract with respect to may-testing equivalence. To our knowledge this is the first result of its kind, for any calculus enriched with data terms. It has particular importance when representing security properties since attackers can be regarded as may-test observers. Full abstraction proves that it does not matter whether such observers are formulated in π or πT, both are equally expressive in this respect. The technical new idea consists of achieving full abstraction by encoding data as table entries rather than active processes, and using a firewalled central integrity manager to ensure data security.

show abstract

“…[3]). For this reason, we keep this section relatively technical apart from stating an outline of the long and complex proof of the full abstraction result.…”

Section: Full Abstractionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Fully Abstract Encoding of the π-Calculus with Data Terms

Baldamus

Parrow

Victor

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

show abstract

“…It is possible to extend a concurrent calculus with cryptographic primitives, as in the spi calculus extension of the π-calculus [2]. Much fundamental progress is being made in this direction.…”

Section: Securitymentioning

confidence: 99%

Abstractions for Mobile Computation

Cardelli

1999

Secure Internet Programming

111

View full text Add to dashboard Cite

show abstract

“…Such properties are generally modelled as a behavioural equivalence (bisimulation or trace equivalence) in a dedicated process calculus such as the Spi [AG99] or applied pi calculus [AF04]. A typical example is real-or-random secrecy: after interacting with a protocol, an adversary is unable to distinguish the real secret used in the protocol from a random value.…”

Section: Introductionmentioning

confidence: 99%

DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice

Cheval

Kremer

Rakotonirina

2018

2018 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

We study the automated verification of behavioural equivalences in the applied pi calculus, an essential problem in formal, symbolic analysis of cryptographic protocols. We establish new complexity results for static equivalence, trace equivalence and labelled bisimilarity and propose a new decision procedure for these equivalences. Our procedure is the first tool to decide trace equivalence and labelled bisimilarity exactly for a family of equational theories, namely those that can be represented by a subterm convergent destructor rewrite system. Finally, we implement the procedure in a new tool, called Deepsec and demonstrate the applicability of the tool on several case studies.

show abstract

A Calculus for Cryptographic Protocols: The Spi Calculus

Cited by 744 publications

References 17 publications

A Fully Abstract Encoding of the π-Calculus with Data Terms

A Fully Abstract Encoding of the π-Calculus with Data Terms

Abstractions for Mobile Computation

DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice

Contact Info

Product

Resources

About