Security Notions and Generic Constructions for Client Puzzles

DOI10.1007/978-3-642-10366-7_30zbMath1267.94050OpenAlexW1492996310MaRDI 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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ 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

This page was built for publication: Security Notions and Generic Constructions for Client Puzzles