Towards a security model for computational puzzle schemes
From MaRDI portal
Publication:3101621
DOI10.1080/00207160.2010.543951zbMath1234.94067OpenAlexW2165688615MaRDI QIDQ3101621
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
Cites Work
- Complexity of a determinate algorithm for the discrete logarithm
- Secure communications over insecure channels
- Timed Release of Standard Digital Signatures
- Security Notions and Generic Constructions for Client Puzzles
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Applied Cryptography and Network Security
- Unnamed Item
- Unnamed Item
- Unnamed Item