Towards a provably secure DoS-Resilient key exchange protocol with perfect forward secrecy
Contribuinte(s) |
Bernstein, Daniel J. Chatterjee, Sanjit |
---|---|
Data(s) |
11/12/2011
|
Resumo |
Just Fast Keying (JFK) is a simple, efficient and secure key exchange protocol proposed by Aiello et al. (ACM TISSEC, 2004). JFK is well known for its novel design features, notably its resistance to denial-of-service (DoS) attacks. Using Meadows’ cost-based framework, we identify a new DoS vulnerability in JFK. The JFK protocol is claimed secure in the Canetti-Krawczyk model under the Decisional Diffie-Hellman (DDH) assumption. We show that security of the JFK protocol, when reusing ephemeral Diffie-Hellman keys, appears to require the Gap Diffie-Hellman (GDH) assumption in the random oracle model. We propose a new variant of JFK that avoids the identified DoS vulnerability and provides perfect forward secrecy even under the DDH assumption, achieving the full security promised by the JFK protocol. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer |
Relação |
http://eprints.qut.edu.au/47824/1/47824a.pdf DOI:10.1007/978-3-642-25578-6_27 Kuppusamy, Lakshmi, Rangasamy, Jothi, Stebila, Douglas, Boyd, Colin, & Nieto, Juan Gonzalez (2011) Towards a provably secure DoS-Resilient key exchange protocol with perfect forward secrecy. In Bernstein, Daniel J. & Chatterjee, Sanjit (Eds.) Indocrypt 2011, Springer, Chennai, India, pp. 379-398. |
Direitos |
Copyright 2011 Springer This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via Lecture Notes in Computer Science http://www.springer.de/comp/lncs/ |
Fonte |
Faculty of Science and Technology; Information Security Institute |
Palavras-Chave | #080303 Computer System Security #Denial of service, Meadows’ cost-based framework, Just Fast Keying, client puzzles, key agreement, perfect forward secrecy |
Tipo |
Conference Paper |