Towards a security model for computational puzzle schemes

DOI10.1080/00207160.2010.543951MaRDI QIDQ3101621zbMATH OpenOpenAlexFDO

Authors Qiang Tang, Arjan Jeckmans

Publication date 29 November 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2010.543951

zbMATH Keywords

computational puzzledeterminable difficultyparallelization

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Security Notions and Generic Constructions for Client Puzzles
• Cryptographic puzzles and DoS resilience, revisited
• Time-lock puzzles in the random oracle model
• Improved cryptographic puzzle based on~modular exponentiation
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols

Cites work

• Applied Cryptography and Network Security
• Complexity of a determinate algorithm for the discrete logarithm
• scientific article; zbMATH DE number 1024065 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• scientific article; zbMATH DE number 1844585 (Why is no real title available?)
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• Secure communications over insecure channels
• Security Notions and Generic Constructions for Client Puzzles
• Timed release of standard digital signatures (extended abstract)

Cited in

(4)

• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Improved cryptographic puzzle based on~modular exponentiation
• Security Notions and Generic Constructions for Client Puzzles
• Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

This page was built for publication: Towards a security model for computational puzzle schemes

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