Depth Robust Graphs and Their Cumulative Memory Complexity

Depth Robust Graphs and Their Cumulative Memory Complexity

Explore a presentation from Eurocrypt 2017 on depth robust graphs and their cumulative memory complexity, delving into the research findings of Joël Alwen, Jeremiah Blocki, and Krzysztof Pietrzak. Gain insights into this cryptographic concept and its implications for memory-hard functions and other applications in the field of cryptography.