Proof of space from stacked expanders

DOI10.1007/978-3-662-53641-4_11zbMATH Open1406.94077OpenAlexW2533275618MaRDI QIDQ3179360FDOQ3179360

Ling Ren, Srinivas Devadas

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_11

Recommendations

• Tight proofs of space and replication
• Proofs of space
• Proofs of space: when space is of the essence
• Simple proofs of space-time and rational proofs of storage
• Beyond Hellman's time-memory trade-offs with applications to proofs of space

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A Remark on Stirling's Formula
• Title not available (Why is that?)
• Complete Register Allocation Problems
• One-Time Computable Self-erasing Functions
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Space bounds for a game on graphs
• Proofs of Space
• Smaller superconcentrators of density 28
• Time-space trade-offs in a pebble game
• Title not available (Why is that?)
• Tradeoff Cryptanalysis of Memory-Hard Functions
• Efficiently Computing Data-Independent Memory-Hard Functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
• Publicly verifiable proofs of sequential work
• Pebbling and Proofs of Work
• Efficient Proofs of Secure Erasure
• Proofs of Space: When Space Is of the Essence
• Advances in Cryptology - CRYPTO 2003
• Secure Code Update for Embedded Devices via Proofs of Secure Erasure
• Key-Evolution Schemes Resilient to Space-Bounded Leakage
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• Title not available (Why is that?)

Cited In (6)

• Proofs of Catalytic Space
• Byzantine generals in the permissionless setting
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• Trapdoor memory-hard functions
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation

This page was built for publication: Proof of space from stacked expanders

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