Cryptographic puzzles and DoS resilience, revisited
@article{Groza2014CryptographicPA, title={Cryptographic puzzles and DoS resilience, revisited}, author={B. Groza and B. Warinschi}, journal={Designs, Codes and Cryptography}, year={2014}, volume={73}, pages={177-207} }
Cryptographic puzzles (or client puzzles) are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step toward rigorous models and proofs of security of applications that employ them (e.g. Denial-of-Service (DoS) resistance). Unfortunately, the subtle interaction between the complex scenarios for which… Expand
17 Citations
A novel puzzle-based framework for mitigating distributed denial of service attacks against internet applications
- Computer Science
- 2015
Pseudonymous Secure Computation from Time-Lock Puzzles
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2014
Designing Proof of Transaction Puzzles for Cryptocurrency
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2017
Moderately Hard Functions: Definition, Instantiations, and Applications
- Computer Science
- TCC
- 2017
Revisiting Client Puzzles for State Exhaustion Attacks Resilience
- Computer Science
- 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
- 2019
Analysis and Comparison of the Network Security Protocol with DoS/DDoS Attack Resistance Performance
- Computer Science
- 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems
- 2015
DNA-based client puzzle for WLAN association protocol against connection request flooding
- Computer Science
- 2016
Dynamic Cipher Puzzle for Efficient Broadcast Authentication in Wireless Sensor Networks
- Computer Science, Medicine
- Sensors
- 2018
References
SHOWING 1-10 OF 33 REFERENCES
Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
- Psychology, Computer Science
- CT-RSA
- 2011
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
- Computer Science
- 2011 Sixth International Conference on Availability, Reliability and Security
- 2011
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles
- Computer Science
- ISPEC
- 2010
A Guided Tour Puzzle for Denial of Service Prevention
- Computer Science
- 2009 Annual Computer Security Applications Conference
- 2009