Toward non-parallelizable client puzzles

Suratose Tritilanunt; Colin Boyd; Ernest Foo; Juan Manuel González Nieto

doi:10.1007/978-3-540-76969-9_16

Toward non-parallelizable client puzzles

Suratose Tritilanunt
, Colin Boyd
, Ernest Foo
, Juan Manuel González Nieto

Queensland University of Technology

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

31 Citations (Scopus)

Abstract

Client puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing out that there is currently no puzzle which satisfies all such properties. We investigate how to provide the property of non-parallelizability in a practical puzzle. After showing that obvious ideas based on hash chains have significant problems, we propose a new puzzle based on the subset sum problem. Despite some practical implementation issues, this is the first example that satisfies all the desirable properties for a client puzzle.

Original language	English
Title of host publication	Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings
Publisher	Springer Verlag
Pages	247-264
Number of pages	18
ISBN (Print)	9783540769682
DOIs	https://doi.org/10.1007/978-3-540-76969-9_16
Publication status	Published - 2007
Externally published	Yes
Event	6th International Conference on Cryptology and Network Security, CANS 2007 - Singapore, Singapore Duration: 8 Dec 2007 → 10 Dec 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4856 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Cryptology and Network Security, CANS 2007
Country/Territory	Singapore
City	Singapore
Period	8/12/07 → 10/12/07

Keywords

Client puzzles
Denial of service attacks
Non-parallelizable cryptographic puzzles

Access to Document

10.1007/978-3-540-76969-9_16

Cite this

Tritilanunt, S., Boyd, C., Foo, E., & Nieto, J. M. G. (2007). Toward non-parallelizable client puzzles. In Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings (pp. 247-264). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4856 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-76969-9_16

@inproceedings{f4bf4cf43d444cd8b6c5861b229f43ab,

title = "Toward non-parallelizable client puzzles",

abstract = "Client puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing out that there is currently no puzzle which satisfies all such properties. We investigate how to provide the property of non-parallelizability in a practical puzzle. After showing that obvious ideas based on hash chains have significant problems, we propose a new puzzle based on the subset sum problem. Despite some practical implementation issues, this is the first example that satisfies all the desirable properties for a client puzzle.",

keywords = "Client puzzles, Denial of service attacks, Non-parallelizable cryptographic puzzles",

author = "Suratose Tritilanunt and Colin Boyd and Ernest Foo and Nieto, \{Juan Manuel Gonz{\'a}lez\}",

year = "2007",

doi = "10.1007/978-3-540-76969-9\_16",

language = "English",

isbn = "9783540769682",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "247--264",

booktitle = "Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings",

note = "6th International Conference on Cryptology and Network Security, CANS 2007 ; Conference date: 08-12-2007 Through 10-12-2007",

}

Tritilanunt, S, Boyd, C, Foo, E & Nieto, JMG 2007, Toward non-parallelizable client puzzles. in Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4856 LNCS, Springer Verlag, pp. 247-264, 6th International Conference on Cryptology and Network Security, CANS 2007, Singapore, Singapore, 8/12/07. https://doi.org/10.1007/978-3-540-76969-9_16

Toward non-parallelizable client puzzles. / Tritilanunt, Suratose; Boyd, Colin; Foo, Ernest et al.
Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings. Springer Verlag, 2007. p. 247-264 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4856 LNCS).

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

TY - GEN

T1 - Toward non-parallelizable client puzzles

AU - Tritilanunt, Suratose

AU - Boyd, Colin

AU - Foo, Ernest

AU - Nieto, Juan Manuel González

PY - 2007

Y1 - 2007

N2 - Client puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing out that there is currently no puzzle which satisfies all such properties. We investigate how to provide the property of non-parallelizability in a practical puzzle. After showing that obvious ideas based on hash chains have significant problems, we propose a new puzzle based on the subset sum problem. Despite some practical implementation issues, this is the first example that satisfies all the desirable properties for a client puzzle.

AB - Client puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing out that there is currently no puzzle which satisfies all such properties. We investigate how to provide the property of non-parallelizability in a practical puzzle. After showing that obvious ideas based on hash chains have significant problems, we propose a new puzzle based on the subset sum problem. Despite some practical implementation issues, this is the first example that satisfies all the desirable properties for a client puzzle.

KW - Client puzzles

KW - Denial of service attacks

KW - Non-parallelizable cryptographic puzzles

UR - https://www.scopus.com/pages/publications/38349080863

U2 - 10.1007/978-3-540-76969-9_16

DO - 10.1007/978-3-540-76969-9_16

M3 - Conference contribution

AN - SCOPUS:38349080863

SN - 9783540769682

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 247

EP - 264

BT - Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings

PB - Springer Verlag

T2 - 6th International Conference on Cryptology and Network Security, CANS 2007

Y2 - 8 December 2007 through 10 December 2007

ER -

Tritilanunt S, Boyd C, Foo E, Nieto JMG. Toward non-parallelizable client puzzles. In Cryptology and Network Security - 6th International Conference, CANS 2007, Proceedings. Springer Verlag. 2007. p. 247-264. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-76969-9_16

Toward non-parallelizable client puzzles

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this