285 search results - page 5 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
ESORICS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
CJ
2007
13 years 7 months ago
2007
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
LICS
1999
IEEE
13 years 11 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...