DOS-resistant authentication with client puzzles
From MaRDI portal
Recommendations
- The moderately hard DoS-resistant authentication protocol on client puzzles
- Security Notions and Generic Constructions for Client Puzzles
- Cryptographic puzzles and DoS resilience, revisited
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- DOS-resistant authentication with client puzzles (transcript of discussion)
Cited in
(21)- Cryptographic puzzles and DoS resilience, revisited
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Towards a security model for computational puzzle schemes
- Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy
- Cryptographic salt: A countermeasure against denial-of-service attacks
- Efficient modular exponentiation-based puzzles for denial-of-service protection
- A game theoretical model of denial of service attacks on internet
- Improved cryptographic puzzle based on~modular exponentiation
- Towards Denial-of-Service-Resilient Key Agreement Protocols
- Security Notions and Generic Constructions for Client Puzzles
- Low-cost secure server connection with limited-privilege clients
- Stateless connections
- The moderately hard DoS-resistant authentication protocol on client puzzles
- DOS-resistant authentication with client puzzles (transcript of discussion)
- Enhancing the resistance of a provably secure key agreement protocol to a denial-of-service attack
- Resource Burning for Permissionless Systems (Invited Paper)
- Cryptography and Coding
- Information Security and Privacy
- Applied Cryptography and Network Security
- Defending hash tables from algorithmic complexity attacks with resource burning
- Bankrupting DoS attackers
This page was built for publication: DOS-resistant authentication with client puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786018)
