Paper 2017/893
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space
Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, and Leonid Reyzin
Abstract
Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don't give meaningful security guarantees due to existing time-memory trade-offs.
In particular, Hellman showed that any permutation over a domain of size
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published by the IACR in ASIACRYPT 2017
- Keywords
- Time-Memory Trade-OffsProofs of SpaceProofs of WorkSpacemintBitcoin.
- Contact author(s)
- habusalah @ ist ac at
- History
- 2017-09-17: received
- Short URL
- https://ia.cr/2017/893
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/893, author = {Hamza Abusalah and Joël Alwen and Bram Cohen and Danylo Khilko and Krzysztof Pietrzak and Leonid Reyzin}, title = {Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/893}, year = {2017}, url = {https://eprint.iacr.org/2017/893} }