Sciweavers

Share
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
9 years 5 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
IH
1999
Springer
9 years 5 months ago
The Cocaine Auction Protocol: On the Power of Anonymous Broadcast
Abstract. Traditionally, cryptographic protocols are described as a sequence of steps, in each of which one principal sends a message to another. It is assumed that the fundamental...
Frank Stajano, Ross J. Anderson
CSFW
1998
IEEE
9 years 5 months ago
Proving Security Protocols with Model Checkers by Data Independence Techniques
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
A. W. Roscoe
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
9 years 5 months ago
The XTR Public Key System
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR ...
Arjen K. Lenstra, Eric R. Verheul
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
9 years 5 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
CSFW
2002
IEEE
9 years 6 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
FCT
2003
Springer
9 years 6 months ago
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
Michele Bugliesi, Ambra Ceccato, Sabina Rossi
CONCUR
2003
Springer
9 years 6 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
LICS
2003
IEEE
9 years 6 months ago
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
Hubert Comon-Lundh, Vitaly Shmatikov
LICS
2003
IEEE
9 years 6 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
books