scispace - formally typeset
Open AccessJournal ArticleDOI

A calculus for cryptographic protocols

Martín Abadi, +1 more
- 10 Jan 1999 - 
- Vol. 148, Iss: 1, pp 1-70
Reads0
Chats0
TLDR
The spi calculus is introduced, an extension of the pi calculus designed for describing and analyzing cryptographic protocols and state their security properties in terms of coarse-grained notions of protocol equivalence.
Abstract
We introduce the spi calculus, an extension of the pi calculus designed for describing and analyzing cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarse-grained notions of protocol equivalence.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Language-based information-flow security

TL;DR: A structured view of research on information-flow security is given, particularly focusing on work that uses static program analysis to enforce information- flow policies, and some important open challenges are identified.
Proceedings ArticleDOI

A calculus for cryptographic protocols: the spi calculus

TL;DR: The spi calculus is introduced, an extension of the pi calculus designed for describing and analyzing cryptographic protocols and state their security properties in terms of coarse-grained notions of protocol equivalence.
Proceedings ArticleDOI

Mobile values, new names, and secure communication

TL;DR: A simple, general extension of the pi calculus with value passing, primitive functions, and equations among terms is introduced, and semantics and proof techniques for this extended language are developed and applied in reasoning about some security protocols.
Journal ArticleDOI

Secrecy by typing in security protocols

TL;DR: These rules have the form of typing rules for a basic concurrent language with cryptographic primitives, the spi calculus, and guarantee that, if a protocol typechecks, then it does not leak its secret inputs.
Journal Article

Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)

TL;DR: In this paper, the authors provide a computational justification for a formal treatment of encryption, by providing a computational model that considers complexity and probability of a cryptosystem's security properties.
References
More filters
Journal ArticleDOI

New Directions in Cryptography

TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI

A method for obtaining digital signatures and public-key cryptosystems

TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Book

Communication and Concurrency

TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Book

Applied Cryptography: Protocols, Algorithms, and Source Code in C

TL;DR: This document describes the construction of protocols and their use in the real world, as well as some examples of protocols used in the virtual world.
Related Papers (5)