Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
From MaRDI portal
Publication:3073713
DOI10.1007/978-3-642-19074-2_19zbMATH Open1284.94113OpenAlexW1548440180MaRDI QIDQ3073713FDOQ3073713
Authors: Douglas Stebila, Lakshmi Kuppusamy, Jothi Rangasamy, Colin A. Boyd, Juan Manuel González Nieto 
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
Recommendations
- Security Notions and Generic Constructions for Client Puzzles
- Cryptographic puzzles and DoS resilience, revisited
- scientific article; zbMATH DE number 1844585
- The moderately hard DoS-resistant authentication protocol on client puzzles
- Efficient modular exponentiation-based puzzles for denial-of-service protection
Cites Work
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Cryptography. Theory and practice
- The security of the cipher block chaining message authentication code
- Title not available (Why is that?)
- Stronger Security of Authenticated Key Exchange
- Title not available (Why is that?)
- Theory of Cryptography
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Pebbling and Proofs of Work
- Just fast keying
- Advances in Cryptology - CRYPTO 2003
- Security Amplification for Interactive Cryptographic Primitives
- Security Notions and Generic Constructions for Client Puzzles
- Title not available (Why is that?)
- Towards Denial-of-Service-Resilient Key Agreement Protocols
- Stateless connections
Cited In (15)
- The superlinearity problem in post-quantum blockchains
- Title not available (Why is that?)
- Cryptography and Coding
- Efficient modular exponentiation-based puzzles for denial-of-service protection
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Title not available (Why is that?)
- Proofs of Work from worst-case assumptions
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Improved cryptographic puzzle based on~modular exponentiation
- Towards a security model for computational puzzle schemes
- The moderately hard DoS-resistant authentication protocol on client puzzles
- Cryptographic puzzles and DoS resilience, revisited
- Security Notions and Generic Constructions for Client Puzzles
- Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy
Uses Software
This page was built for publication: Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073713)
