Completed
What iMHFs are maximally bandwidth hard?
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Bandwidth-Hard Functions - Reductions and Lower Bounds
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Motivation: Offline Attacks
- 3 Offline Attacks: A Common Problem
- 4 Desiderata: Moderately Hard Function
- 5 What is the ASIC Advantage?
- 6 Reducing ASIC Advantage
- 7 Data Independent Memory Hard Function (IMHF)
- 8 Data Independent Labeling Function GH
- 9 Evaluating an iMHF (red-blue pebbling)
- 10 Red-Blue Pebbling Cost RD17
- 11 What iMHFs are maximally bandwidth hard?
- 12 Pebbling Reduction?
- 13 Energy Cost of an Algorithm
- 14 Energy Cost of a Function
- 15 Pebbling Reduction: Random Oracle Model
- 16 Pebbling Lower Bounds
- 17 Conclusion
