Efficient Client Puzzle Schemes to Mitigate DoS Attacks

Qiang Tang; Arjan Jeckmans

doi:10.1109/CIS.2010.70

Efficient Client Puzzle Schemes to Mitigate DoS Attacks

Qiang Tang, Arjan Jeckmans

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

195 Downloads (Pure)

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.

Original language	Undefined
Title of host publication	International Conference on Computational Intelligence and Security (CIS 2010)
Place of Publication	USA
Publisher	IEEE
Pages	293-297
Number of pages	5
ISBN (Print)	978-1-4244-9114-8
DOIs	https://doi.org/10.1109/CIS.2010.70
Publication status	Published - Dec 2010
Event	International Conference on Computational Intelligence and Security, CIS 2010 - Nanning, China Duration: 11 Dec 2010 → 14 Dec 2010

Publication series

Name
Publisher	IEEE Computational Intelligence Society

Conference

Conference	International Conference on Computational Intelligence and Security, CIS 2010
Period	11/12/10 → 14/12/10
Other	11-14 dec 2010

Keywords

METIS-277477
EWI-19185
SCS-Cybersecurity
IR-75366

Access to Document

10.1109/CIS.2010.70

Cite this

@inproceedings{b25484f47c9b4942a71c30e9f4ff3d21,

title = "Efficient Client Puzzle Schemes to Mitigate DoS Attacks",

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.",

keywords = "METIS-277477, EWI-19185, SCS-Cybersecurity, IR-75366",

author = "Qiang Tang and Arjan Jeckmans",

note = "10.1109/CIS.2010.70 ; International Conference on Computational Intelligence and Security, CIS 2010 ; Conference date: 11-12-2010 Through 14-12-2010",

year = "2010",

month = dec,

doi = "10.1109/CIS.2010.70",

language = "Undefined",

isbn = "978-1-4244-9114-8",

publisher = "IEEE",

pages = "293--297",

booktitle = "International Conference on Computational Intelligence and Security (CIS 2010)",

address = "United States",

}

TY - GEN

T1 - Efficient Client Puzzle Schemes to Mitigate DoS Attacks

AU - Tang, Qiang

AU - Jeckmans, Arjan

N1 - 10.1109/CIS.2010.70

PY - 2010/12

Y1 - 2010/12

N2 - 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.

AB - 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.

KW - METIS-277477

KW - EWI-19185

KW - SCS-Cybersecurity

KW - IR-75366

U2 - 10.1109/CIS.2010.70

DO - 10.1109/CIS.2010.70

M3 - Conference contribution

SN - 978-1-4244-9114-8

SP - 293

EP - 297

BT - International Conference on Computational Intelligence and Security (CIS 2010)

PB - IEEE

CY - USA

T2 - International Conference on Computational Intelligence and Security, CIS 2010

Y2 - 11 December 2010 through 14 December 2010

ER -