285 search results - page 3 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
CSFW
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper we present an improved logic for analysing authentication properties of cryptographic protocols, based on the SVO logic of Syverson and van Oorschot. Such logics are...
CCS
2006
ACM
13 years 10 months ago
2006
ACM
SP
2008
IEEE
13 years 4 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
ESORICS
2004
Springer
13 years 11 months ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...