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
Pseudonymous Secure Computation from Time-Lock Puzzles
Designing Proof of Transaction Puzzles for Cryptocurrency
Moderately Hard Functions: Definition, Instantiations, and Applications
Revisiting Client Puzzles for State Exhaustion Attacks Resilience
Provable Security for Cryptocurrencies
Analysis and Comparison of the Network Security Protocol with DoS/DDoS Attack Resistance Performance
  • Linzhi Jiang, Chunxiang Xu, Xiaofang Wang, Y. Zhou
  • 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
Dynamic Cipher Puzzle for Efficient Broadcast Authentication in Wireless Sensor Networks
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
A Guided Tour Puzzle for Denial of Service Prevention
  • M. Abliz, T. Znati
  • Computer Science
  • 2009 Annual Computer Security Applications Conference
  • 2009
...
1
2
3
4
...