Security Notions and Generic Constructions for Client Puzzles
From MaRDI portal
Publication:3650711
DOI10.1007/978-3-642-10366-7_30zbMath1267.94050MaRDI QIDQ3650711
P. Morrissey, Bogdan Warinschi, Liqun Chen, Nigel P. Smart
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_30
Related Items
Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting), Cryptographic puzzles and DoS resilience, revisited, Indistinguishable Proofs of Work or Knowledge, Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols, Towards a security model for computational puzzle schemes, Improved Cryptographic Puzzle Based on Modular Exponentiation