On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

DOI10.1007/978-3-662-49896-5_13zbMath1369.94518OpenAlexW2439469608MaRDI QIDQ5739208

Joël Alwen, Stefano Tessaro, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Binyi Chen

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Proof of Space from Stacked Expanders ⋮ Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks ⋮ Parallelizable delegation from LWE ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Efficiently Computing Data-Independent Memory-Hard Functions ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Scrypt Is Maximally Memory-Hard

This page was built for publication: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model