A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Low-Cost Client Puzzles Based on Modular Exponentiation
[chapter]
2010
Lecture Notes in Computer Science
Client puzzles have been proposed as a useful mechanism for mitigating Denial of Service attacks on network protocols. While several puzzles have been proposed in recent years, most existing nonparallelizable puzzles are based on modular exponentiations. The main drawback of these puzzles is in the high cost that they incur on the puzzle generator (the verifier). In this paper, we propose cryptographic puzzles based on modular exponentiation that reduce this overhead. Our constructions are
doi:10.1007/978-3-642-15497-3_41
fatcat:e4kbjklxkbeufirmqzwcdbhzs4