65 search results - page 2 / 13 » Computationally Sound Abstraction and Verification of Secure... |
CSFW
2007
IEEE
14 years 5 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...
CCS
2005
ACM
14 years 4 months ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
TGC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
CCS
2009
ACM
14 years 5 months 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...
SAC
2010
ACM
13 years 8 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...