Using rhythmic nonces for puzzle-based DoS resistance

To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but if the server is under attack, resources consumed by managing certain protocols can lead to DoS vulnerabilities. To help alleviate this problem, we propose the concept of rhythmic nonces, a cryptographic tool that allows servers to measure request freshness with minimal bookkeeping costs. We explore the impact of this service in the context of a puzzle-based DoS resistance scheme we call "SYN puzzles". Our preliminary results based on mathematical analysis and evaluation of a prototype suggests that our scheme is more resistant than existing techniques.

• Type: Conference
• Year: 2008
• Where: CCS
• Authors: Ellick Chan, Carl A. Gunter, Sonia Jahid, Evgeni Peryshkin, Daniel Rebolledo
• Keywords: CCS 2008, Minimal Bookkeeping Costs, Puzzle-based Dos Resistance, Request Freshness, Security Privacy