Provably memory-hard proofs of work with memory-easy verification

DOI10.1007/978-3-032-12290-2_17MaRDI QIDQ7233245zbMATH OpenFDO

Authors Jeremiah Blocki, Nathan Smearsoll

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12290-2_17

zbMATH Keywords

distributed consensus protocolsspam-mitigation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Bandwidth hard functions for ASIC resistance
• Data-independent memory hard functions: new attacks and stronger constructions
• Depth-robust graphs and their cumulative memory complexity
• Efficiently computing data-independent memory-hard functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• On the depth-robustness and cumulative pebbling cost of Argon2i
• On the security of proofs of sequential work in a post-quantum world
• One-time computable self-erasing functions
• Proofs of Catalytic Space
• Proofs of space
• Publicly verifiable proofs of sequential work
• Scrypt is maximally memory-hard
• Simple proofs of sequential work
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Sustained space complexity
• Symmetrically and asymmetrically hard cryptography
• Time-memory tradeoff attacks on the MTP proof-of-work scheme
• Trapdoor memory-hard functions

This page was built for publication: Provably memory-hard proofs of work with memory-easy verification

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