38 search results - page 2 / 8 » Soundness Conditions for Message Encoding Abstractions in Fo... |
CCS
2010
ACM
13 years 8 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...
CCS
2009
ACM
14 years 3 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...
CSFW
2006
IEEE
14 years 2 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...
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
Traditional security protocols are mainly concerned with key establishment and principal authentication and rely on predistributed keys and properties of cryptographic operators. I...