Results 1  10
of
945,508
Applied pi calculus
, 2011
"... The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational
for the Applied Pi Calculus ∗
"... We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs fro ..."
Abstract
 Add to MetaCart
We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs
Proof System for Applied Pi Calculus
"... Abstract. A symbolicstyle proof system is presented to reason about observational equivalence for applied picalculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied picalculus. The completeness result of the proo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. A symbolicstyle proof system is presented to reason about observational equivalence for applied picalculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied picalculus. The completeness result
Symbolic bisimulation for the applied picalculus
 In Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’07), volume 4855 of Lecture Notes in Computer Science
, 2007
"... We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs fro ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
We propose a symbolic semantics for the finite applied pi calculus. The applied pi calculus is a variant of the pi calculus with extensions for modelling cryptographic protocols. By treating inputs symbolically, our semantics avoids potentially infinite branching of execution trees due to inputs
The Applied Pi Calculus is introduced by Abadi and
"... Abstract—A notion of open bisimulation is proposed for the Applied Pi Calculus, which extends πcalculus in order to facilitate analyzing security protocols. Our notion is based on the labeled transition system, and takes a knowledge aware open approach to model knowledge in security protocols. It i ..."
Abstract
 Add to MetaCart
Abstract—A notion of open bisimulation is proposed for the Applied Pi Calculus, which extends πcalculus in order to facilitate analyzing security protocols. Our notion is based on the labeled transition system, and takes a knowledge aware open approach to model knowledge in security protocols
A Probabilistic Applied Pi–Calculus
, 2007
"... We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve the nonde ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We propose an extension of the Applied Pi–calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala’s Probabilistic Automata driven by schedulers which resolve
M.: Untraceability in the applied pi calculus
 In: proc. of the 1st Int. Workshop on RFID Security and Cryptography
, 2009
"... The use of RFID tags in personal items, such as passports, may make it possible to track a person’s movements. Even RFID protocols that encrypt their identity may leak enough information to let an attacker trace a tag. In this paper we define strong and weak forms of untraceablility, and illustrate ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
these definitions with a simple example. We formally define these concepts in the applied picalculus which in some cases makes it possible to automatically check if an RFID tag running a particular protocol is untraceable. database reader reader tag tag tag tag tag tag tag tag 1
Epistemic Logic for the Applied Pi Calculus ⋆
"... Abstract. We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as equivalences. While process calculi provide a natural means to describe t ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Abstract. We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as equivalences. While process calculi provide a natural means to describe
Analysis of an electronic voting protocol in the applied picalculus
 In Proc. 14th European Symposium On Programming (ESOP’05), volume 3444 of LNCS
, 2005
"... Abstract. Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. The ap ..."
Abstract

Cited by 86 (9 self)
 Add to MetaCart
. The applied pi calculus is a formalism for modelling such protocols, and allows us to verify properties by using automatic tools, and to rely on manual proof techniques for cases that automatic tools are unable to handle. We model a known protocol for elections known as FOO 92 in the applied pi calculus
Hiding names: Private authentication in the applied pi calculus
 In Software Security – Theories and Systems. MextNSFJSPS International Symposium (ISSS’02
, 2003
"... Abstract. We present the analysis of a protocol for private authentication in the applied pi calculus. We treat authenticity and secrecy properties of the protocol. Although such properties are fairly standard, their formulation in the applied pi calculus makes an original use of process equivalence ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Abstract. We present the analysis of a protocol for private authentication in the applied pi calculus. We treat authenticity and secrecy properties of the protocol. Although such properties are fairly standard, their formulation in the applied pi calculus makes an original use of process
Results 1  10
of
945,508