25 search results - page 2 / 5 » Soundness of Formal Encryption in the Presence of Active Adv... |
JCS
2010
13 years 3 months ago
2010
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...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
ESORICS
2007
Springer
13 years 11 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...
CCS
2010
ACM
13 years 5 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...