Bandwidth-Hard Functions - Reductions and Lower Bounds
Association for Computing Machinery (ACM) via YouTube
Overview
Syllabus
Intro
Motivation: Offline Attacks
Offline Attacks: A Common Problem
Desiderata: Moderately Hard Function
What is the ASIC Advantage?
Reducing ASIC Advantage
Data Independent Memory Hard Function (IMHF)
Data Independent Labeling Function GH
Evaluating an iMHF (red-blue pebbling)
Red-Blue Pebbling Cost RD17
What iMHFs are maximally bandwidth hard?
Pebbling Reduction?
Energy Cost of an Algorithm
Energy Cost of a Function
Pebbling Reduction: Random Oracle Model
Pebbling Lower Bounds
Conclusion
Taught by
Association for Computing Machinery (ACM)