50 search results - page 1 / 10 » Computational soundness for key exchange protocols with symm... |
CCS
2009
ACM
13 years 11 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
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...
JDCTA
2010
12 years 11 months ago
2010
In wireless ad hoc networks environment, Bellovin and Merritt first developed a password-based Encrypted Key Exchange (EKE) protocol against offline dictionary attacks using both ...
PKC
2012
Springer
11 years 7 months ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...
CSFW
2006
IEEE
13 years 11 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...