Results 1  10
of
1,176,125
On Compositional Reasoning in the Spicalculus
 In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FossaCS’02), volume 2303 of LNCS
, 2002
"... Observational equivalences can be used to reason about the correctness of security protocols described in the spicalculus. Unlike in CCS or in #calculus, these equivalences do not enjoy a simple formulation in spicalculus. The present paper aims at enriching the set of tools for reasoning on proc ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
on processes by providing a few equational laws for a sensible notion of spibisimilarity. We discuss the di#culties underlying compositional reasoning in spicalculus and show that, in some cases and with some care, the proposed laws can be used to build compositional proofs. A selection of these laws forms
PatternMatching SpiCalculus
 In Formal Aspects in Security and Trust
, 2004
"... Abstract. Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on types for authenticity did not allow for such nested cryptography. In this work, we present the patternmatching s ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
matching spicalculus, which is an obvious extension of the spicalculus to include patternmatching as primitive. The novelty of the language is in the accompanying type system, which uses the same language of patterns to describe complex data dependencies which cannot be described using prior type systems
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of 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 ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of 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 SpiCalculus and a Bisimulation Method
, 1999
"... We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a] i ..."
Abstract
 Add to MetaCart
We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a
A BRUTUS Logic for the SpiCalculus
 In: Proceedings of the IFIP Workshop on Issues in the Theory of Security. (2001
, 2001
"... A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect
Symbolic Analysis of Cryptographic Protocols in the SpiCalculus
 In ICALP
, 2000
"... In the spicalculus a cryptographic protocol can be described as a concurrent process. Analysis of the traces generated by this process can be used to verify authentication and secrecy properties of the protocol. However, the set of traces is typically very large or innite. We propose a symbolic ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
to be complete for a wide class of protocols and properties and is amenable to automatic checking. This immediately yields decidability results. Keywords: spicalculus, reasoning about security, concurrency. Author's Address: Dipartimento di Sistemi e Informatica, Universita di Firenze, Via Lombroso 6
Timed spicalculus with types for secrecy and authenticity
 In CONCUR’05: Concurrency Theory
, 2005
"... Abstract. We present a discretely timed spicalculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker model. A primitive for reading a global clock allows us to express protocols based on timestamps, which are common in prac ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We present a discretely timed spicalculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker model. A primitive for reading a global clock allows us to express protocols based on timestamps, which are common
A BRUTUS Logic for a SpiCalculus Dialect
"... In the field of process algebras, the spicalculus, a modified version of the calculus with encryption primitives, is indicated as an expressive specification language for cryptographic protocols. In spicalculus basic security properties, such as secrecy and integrity can be formalized as may ..."
Abstract
 Add to MetaCart
In the field of process algebras, the spicalculus, a modified version of the calculus with encryption primitives, is indicated as an expressive specification language for cryptographic protocols. In spicalculus basic security properties, such as secrecy and integrity can be formalized as may
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 631 (4 self)
 Add to MetaCart
Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations
Results 1  10
of
1,176,125