15 search results - page 2 / 3 » Soundness Conditions for Cryptographic Algorithms and Parame... |
SP
2006
IEEE
13 years 11 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
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...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
ASIAN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
CCS
2009
ACM
14 years 4 days ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...