Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols

DOI10.1007/978-3-642-19074-2_19MaRDI QIDQ3073713zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

protocolsproof of workclient puzzlesdenial of service resistance

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• scientific article; zbMATH DE number 1844585 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Cryptography. Theory and practice
• Just fast keying
• Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
• Pebbling and Proofs of Work
• Security Amplification for Interactive Cryptographic Primitives
• Security Notions and Generic Constructions for Client Puzzles
• Stateless connections
• Stronger Security of Authenticated Key Exchange
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• The security of the cipher block chaining message authentication code
• Theory of Cryptography
• Towards Denial-of-Service-Resilient Key Agreement Protocols

Cited in

(15)

• scientific article; zbMATH DE number 1844585 (Why is no real title available?)
• The superlinearity problem in post-quantum blockchains
• 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
• scientific article; zbMATH DE number 1844586 (Why is no real title available?)
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• 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
• Cryptographic puzzles and DoS resilience, revisited
• The moderately hard DoS-resistant authentication protocol on client puzzles
• Security Notions and Generic Constructions for Client Puzzles
• Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy

Describes a project that uses

Uses Software

• NAXOS

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)