Toward Non-parallelizable Client Puzzles

Tritilanunt, Suratose, Boyd, Colin A., Foo, Ernest, & Gonzalez Nieto, Juan M. (2007) Toward Non-parallelizable Client Puzzles. Cryptology and Network Security (LNCS), 4856, pp. 247-264.

View at publisher


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.

Impact and interest:

10 citations in Scopus
Search Google Scholar™
15 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

675 since deposited on 16 Oct 2008
14 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 15210
Item Type: Journal Article
Refereed: Yes
Keywords: Denial of Service Attacks, Client Puzzles, Non, Parallelizable Cryptographic Puzzles
DOI: 10.1007/978-3-540-76969-9_16
ISBN: 9783540769682
ISSN: 1611-3349
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DATA FORMAT (080400) > Data Format not elsewhere classified (080499)
Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Institutes > Information Security Institute
Copyright Owner: Copyright 2007 Springer
Copyright Statement: This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink. Lecture Notes in Computer Science
Deposited On: 16 Oct 2008 00:00
Last Modified: 29 Feb 2012 13:34

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page