Explore a comprehensive analysis of the Scrypt memory-hard function presented at Eurocrypt 2017. Delve into the paper by Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, and Stefano Tessaro, which examines time complexity, memory-hard functions, and IMH halves. Learn about the run game, simple and general strategies, and technical barriers associated with Scrypt. Gain insights into the maximally memory-hard properties of this cryptographic function through a structured presentation covering introduction, outline, romics, summary, and conclusion, followed by a Q&A session.
Overview
Syllabus
Intro
Time complexity
Memory hard function
IMH halves
A script
Outline
Romics
Run Game
Simple Strategy
General Strategy
Technical Barriers
Summary
Conclusion
Questions
Taught by
TheIACR
Related Courses
-
Efficiently Computing Data Independent Memory Hard Functions
-
Depth Robust Graphs and Their Cumulative Memory Complexity
-
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
-
Bandwidth-Hard Functions - Reductions and Lower Bounds
-
Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks
-
Time Memory Tradeoff Attacks on the MTP Proof of Work Scheme
