Sciweavers

154 search results - page 2 / 31
» Cryptographically Sound Theorem Proving
Sort
View
ESORICS
2004
Springer
14 years 23 days ago
A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
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...
Michael Backes
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
GG
2008
Springer
13 years 8 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
CSFW
2005
IEEE
14 years 1 months ago
A Cryptographically Sound Dolev-Yao Style Security Proof of an Electronic Payment System
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
Michael Backes, Markus Dürmuth
JCS
2010
121views more  JCS 2010»
13 years 5 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh