Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
From MaRDI portal
Publication:3073713
DOI10.1007/978-3-642-19074-2_19zbMath1284.94113OpenAlexW1548440180MaRDI QIDQ3073713
Lakshmi Kuppusamy, Jothi Rangasamy, Douglas Stebila, Juan Manuel González Nieto, Colin A. Boyd
Publication date: 11 February 2011
Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/40036/6/40036-full-revised.pdf
Related Items (7)
Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Proofs of Work from worst-case assumptions ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ Cryptographic puzzles and DoS resilience, revisited ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy
Uses Software
Cites Work
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
- Stronger Security of Authenticated Key Exchange
- Just fast keying
- Security Amplification for Interactive Cryptographic Primitives
- Towards Denial-of-Service-Resilient Key Agreement Protocols
- Security Notions and Generic Constructions for Client Puzzles
- Stateless connections
- Advances in Cryptology - CRYPTO 2003
- Pebbling and Proofs of Work
- Theory of Cryptography
- The security of the cipher block chaining message authentication code
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
