Pebbling and Proofs of Work

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

• Proofs of space: when space is of the essence
• Proofs of space
• Advances in Cryptology - CRYPTO 2003
• Simple proofs of sequential work
• Publicly verifiable proofs of sequential work

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Cited In (26)

• Individual cryptography
• Better incentives for proof-of-work
• Proofs of Catalytic Space
• Title not available (Why is that?)
• Parallelizable delegation from LWE
• How to build time-lock encryption
• Advances in Cryptology - CRYPTO 2003
• Proofs of Space
• 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
• Proof of Space from Stacked Expanders
• Efficiently Computing Data-Independent Memory-Hard Functions
• SPARKs: succinct parallelizable arguments of knowledge
• Tight time-space lower bounds for finding multiple collision pairs and their applications
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• 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
• Cumulative Space in Black-White Pebbling and Resolution
• The cost of adaptivity in security games on graphs
• PoW-Based Distributed Cryptography with No Trusted Setup
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Scrypt Is Maximally Memory-Hard

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)