2012
DOI: 10.1007/978-3-642-31912-9_21
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection

Abstract: Abstract. Client puzzles are moderately-hard cryptographic problems -neither easy nor impossible to solve -that can be used as a countermeasure 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 gen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
16
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(17 citation statements)
references
References 17 publications
1
16
0
Order By: Relevance
“…Decreasing this threshold value will increase the difficulty, since one must compute the hash function on more inputs to find an output that is sufficiently small. We note that many other types of puzzles exist (for examples, see [87,93,135]) and our results are likely compatible with other designs.…”
Section: Computational Puzzlessupporting
confidence: 79%
“…Decreasing this threshold value will increase the difficulty, since one must compute the hash function on more inputs to find an output that is sufficiently small. We note that many other types of puzzles exist (for examples, see [87,93,135]) and our results are likely compatible with other designs.…”
Section: Computational Puzzlessupporting
confidence: 79%
“…Recently, Rangasamy et al [67] proposed a modular exponentiation-based client puzzle which can be seen as an efficient alternative to Rivest et al 's time-lock puzzle. Unlike the Rivest et al and Karame-Čapkun puzzle, Rangasamy et al 's puzzle does not require the server to perform any online exponentiations.…”
Section: → ( )mentioning
confidence: 99%
“…Though Karame and Čapkun's puzzle is superior in efficiency compared to Rivestet al puzzle, it still requires modular exponentiation for puzzle verification. To avoid mdoular exponentiation in the Karame-Čapkun puzzle verification, an alternative construction, namely RSApuz was proposed in [18], wherein the verification requires only few modular multiplications. However, the approach in [18] works only for the fixed difficulty level.…”
Section: Modular Exponentiation-based Puzzlementioning
confidence: 99%