Applied Cryptography and Network Security

DOI10.1007/11767480zbMATH Open1151.94604OpenAlexW4211109874MaRDI QIDQ5899211FDOQ5899211

Authors: Sujata Doshi, Fabian Monrose, Aviel D. Rubin 

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11767480

Recommendations

• Security Notions and Generic Constructions for Client Puzzles
• Cryptographic puzzles and DoS resilience, revisited
• Cryptography and Coding
• scientific article; zbMATH DE number 1844585
• Efficient modular exponentiation-based puzzles for denial-of-service protection

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62) Computer system organization (68M99)

Cited In (5)

• Puzzle-based storage systems
• Cryptography and Coding
• Advances in Cryptology - CRYPTO 2003
• Improved cryptographic puzzle based on~modular exponentiation
• Towards a security model for computational puzzle schemes

This page was built for publication: Applied Cryptography and Network Security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899211)