Pebbling and Proofs of Work
From MaRDI portal
Publication:5451017
DOI10.1007/11535218_3zbMATH Open1145.68427OpenAlexW1875376608MaRDI QIDQ5451017FDOQ5451017
Authors: Cynthia Dwork, Moni Naor, Hoeteck Wee 
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_3
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Cited In (28)
- Individual cryptography
- Better incentives for proof-of-work
- Proofs of Catalytic Space
- Proofs of space: when space is of the essence
- Title not available (Why is that?)
- Parallelizable delegation from LWE
- Proof of space from stacked expanders
- How to build time-lock encryption
- Advances in Cryptology - CRYPTO 2003
- Moderately hard functions: definition, instantiations, and applications
- Efficiently computing data-independent memory-hard functions
- Depth-robust graphs and their cumulative memory complexity
- Scrypt is maximally memory-hard
- Cumulative space in black-white pebbling and resolution
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Cryptographic primitives enforcing communication and storage complexity
- Nullstellensatz size-degree trade-offs from reversible pebbling
- PoW-based distributed cryptography with no trusted setup
- SPARKs: succinct parallelizable arguments of knowledge
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- On sequential functions and fine-grained cryptography
- The cost of adaptivity in security games on graphs
- Proofs of space
This page was built for publication: Pebbling and Proofs of Work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451017)
