Proof of space from stacked expanders

DOI10.1007/978-3-662-53641-4_11MaRDI QIDQ3179360zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 3478425 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 2079357 (Why is no real title available?)
• A Remark on Stirling's Formula
• Advances in Cryptology - CRYPTO 2003
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Complete Register Allocation Problems
• Efficient Proofs of Secure Erasure
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Key-evolution schemes resilient to space-bounded leakage
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• One-time computable self-erasing functions
• Pebbling and Proofs of Work
• Proofs of space
• Proofs of space: when space is of the essence
• Publicly verifiable proofs of sequential work
• Secure Code Update for Embedded Devices via Proofs of Secure Erasure
• Smaller superconcentrators of density 28
• Space bounds for a game on graphs
• Time-space trade-offs in a pebble game
• Tradeoff Cryptanalysis of Memory-Hard Functions

Cited in

(12)

• Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
• Proofs of space: when space is of the essence
• Proofs of Catalytic Space
• Byzantine generals in the permissionless setting
• SNACKs for proof-of-space blockchains
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• Space-deniable proofs
• Cumulative memory lower bounds for randomized and quantum computation
• Trapdoor memory-hard functions
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• Proofs of space

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)