Efficiently Computing Data Independent Memory Hard Functions

Explore the concept of efficiently computing data independent memory hard functions in this 24-minute conference talk from Crypto 2016. Delve into the problem of memory hard functions, understanding what an IMHF is and its importance in cryptography. Examine key concepts such as spacetime complexity, cumulative complexity, and depth robustness. Learn about general attacks, the main theorem presented, and its implications. Discover practical applications and results of ideal memory hard functions in cryptographic systems. Gain insights from speakers Joël Alwen and Jeremiah Blocki as they discuss this crucial topic in modern cryptography.

Introduction
The Problem
Memory Hard Functions
What is an IMHF
Spacetime Complexity
Cumulative Complexity
Desirable Goals
Depth Robustness
General Attack
Main Theorem
Natural Question
Outline
Do I deal memory hard functions
In practice
Results
Conclusion