50 search results - page 2 / 10 » Computational soundness for key exchange protocols with symm... |
CCS
2005
ACM
13 years 11 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...
EUROCRYPT
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
CTRSA
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
GI
2004
Springer
13 years 11 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
CCS
2008
ACM
13 years 8 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...