Tight proofs of space and replication

DOI10.1007/978-3-030-17656-3_12OpenAlexW2889291629MaRDI QIDQ2292875

Ben Fisch

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_12

zbMATH Keywords

constant-degree expander graphsstacked depth robust graphs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

SnarkPack: practical SNARK aggregation ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Proofs for inner pairing products and applications ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation ⋮ Cryptanalysis of algebraic verifiable delay functions ⋮ Universal vector commitments ⋮ Incompressible encodings

This page was built for publication: Tight proofs of space and replication