Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
Contribuinte(s) |
Kiayias, Aggelos |
---|---|
Data(s) |
2011
|
Resumo |
Client puzzles are meant to act as a defense against denial of service (DoS) attacks by requiring a client to solve some moderately hard problem before being granted access to a resource. However, recent client puzzle difficulty definitions (Stebila and Ustaoglu, 2009; Chen et al., 2009) do not ensure that solving n puzzles is n times harder than solving one puzzle. Motivated by examples of puzzles where this is the case, we present stronger definitions of difficulty for client puzzles that are meaningful in the context of adversaries with more computational power than required to solve a single puzzle. A protocol using strong client puzzles may still not be secure against DoS attacks if the puzzles are not used in a secure manner. We describe a security model for analyzing the DoS resistance of any protocol in the context of client puzzles and give a generic technique for combining any protocol with a strong client puzzle to obtain a DoS-resistant protocol. |
Formato |
application/pdf application/pdf |
Identificador | |
Publicador |
Springer |
Relação |
http://eprints.qut.edu.au/40036/1/c40036.pdf http://eprints.qut.edu.au/40036/6/40036-full-revised.pdf DOI:10.1007/978-3-642-19074-2_19 Stebila, Douglas, Kuppusamy, Lakshmi, Rangasamy, Jothi, Boyd, Colin, & Gonzalez Nieto, Juan (2011) Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. In Kiayias, Aggelos (Ed.) Topics in Cryptology – CT-RSA 2011, Springer, San Francisco, California, pp. 284-301. |
Direitos |
Copyright 2011 Springer-Verlag Berlin Heidelberg This is the author-version of the work. Lecture Notes in Computer Science published, by Springer Verlag, will be available via SpringerLink. http://www.springer.de/comp/lncs/ |
Fonte |
Computer Science; Faculty of Science and Technology; Information Security Institute |
Palavras-Chave | #080303 Computer System Security #080402 Data Encryption #080503 Networking and Communications #client puzzles #proof of work #denial of service resistance #protocols |
Tipo |
Conference Paper |