Slides

More documents

Recommendations

Info

Server computes: Puzzle construction secret S time T request R hash pre-image X Puzzle hash image Y
Puzzle properties ◆ Puzzles are stateless (client provides T and R with puzzle) ◆ Puzzles are easy to verify ◆ Hardness of puzzles can be carefully controlled ◆ Puzzles use standard cryptographic primitives
Page 1 and 2: Client Puzzles A Cryptographic Defe
Page 3 and 4: How to disable a restaurant Restaur
Page 5 and 6: Restauranteur Saboteur No More Tabl
Page 7 and 8: ◆ TCP SYN is a real-world problem
Page 9 and 10: IP Tracing (or Syncookies) Client S
Page 11 and 12: Connection timeout (for buffers) Se
Page 13 and 14: Our solution: client puzzles
Page 15 and 16: Intuition Suppose: ◆ A puzzle tak
Page 17 and 18: The client puzzle protocol Client S
Page 19 and 20: What does a puzzle look like
Page 21: Puzzle construction Client Server S
Page 25 and 26: Some pros Avoids many flaws in othe
Page 27 and 28: Client puzzles seem most suitable f
Page 29 and 30: What’s in the paper ◆ Introduce
Page 31 and 32: More work on puzzles Puzzles have a
Page 33: Questions e-mail: ari@rsa.com

Slides

Create successful ePaper yourself

Delete template?

Save as template?