Efficient Client Puzzle Schemes to Mitigate DoS Attacks

Tang, Qiang and Jeckmans, Arjan (2010) Efficient Client Puzzle Schemes to Mitigate DoS Attacks. In: International Conference on Computational Intelligence and Security, CIS 2010, 11-14 dec 2010, Nanning, China.

Preview

PDF
115Kb

Abstract:	A (computational) client puzzle scheme enables a client to prove to a server that a certain amount of computing resources (CPU cycles and/or Memory look-ups) has been dedicated to solve a puzzle. In a number of different scenarios, researchers have applied client puzzle schemes to mitigate DoS attacks. In this paper, we introduce two batch verification modes for the RSW client puzzle scheme in order to improve the verification efficiency for the server, and investigate three methods for handling incorrect solutions in batch verifications.
Item Type:	Conference or Workshop Item
Copyright:	© 2010 IEEE
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Distributed and Embedded Systems (DIES)
Link to this item:	http://purl.utwente.nl/publications/75366
Conference URL:	http://cis.gdut.edu.cn/cis2010/Home.html
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page