Efficient modular exponentiation-based puzzles for denial-of-service protection

Rangasamy, Jothi, Stebila, Douglas, Kuppusamy, Lakshmi, Boyd, Colin, & Gonzalez Nieto, Juan M. (2012) Efficient modular exponentiation-based puzzles for denial-of-service protection. Lecture Notes in Computer Science, 7259, pp. 319-331.

[img] Accepted Version (PDF 444kB)
Available to QUT staff and students only | Request a copy from author

View at publisher


Client puzzles are moderately-hard cryptographic problems neither easy nor impossible to solve that can be used as a counter-measure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such as non-parallelisability, deterministic solving time, and linear granularity. We propose an efficient client puzzle based on modular exponentiation. Our puzzle requires only a few modular multiplications for puzzle generation and verification. For a server under denial of service attack, this is a significant improvement as the best known non-parallelisable puzzle proposed by Karame and Capkun (ESORICS 2010) requires at least 2k-bit modular exponentiation, where k is a security parameter. We show that our puzzle satisfies the unforgeability and difficulty properties defined by Chen et al. (Asiacrypt 2009). We present experimental results which show that, for 1024-bit moduli, our proposed puzzle can be up to 30 times faster to verify than the Karame-Capkun puzzle and 99 times faster than the Rivest et al.'s time-lock puzzle.

Impact and interest:

2 citations in Scopus
Search Google Scholar™

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.

ID Code: 47894
Item Type: Journal Article
Refereed: Yes
Additional Information: This paper has been accepted and presented at the 14th International Conference on Information Security and Cryptology- ICISC 2011, November 30-December 2, 2011, Seoul, Korea. The pre-proceedings were given to the attendees but the main proceedings being published by Springer in LNCS series will be available online soon. More details can be found at http://www.icisc.org.
Additional URLs:
Keywords: client puzzles, RSA, time-lock puzzles, denial of service resistance, puzzle difficulty
DOI: 10.1007/978-3-642-31912-9_21
ISSN: 0302-9743
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > COMPUTER SOFTWARE (080300) > Computer System Security (080303)
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2011 Springer
Copyright Statement: The definitive work is available from http://www.springerlink.com/
Deposited On: 22 Dec 2011 23:20
Last Modified: 15 Jul 2017 06:30

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page