Bandwidth-Hard Functions - Reductions and Lower Bounds

Bandwidth-Hard Functions - Reductions and Lower Bounds

Association for Computing Machinery (ACM) via YouTube Direct link

What is the ASIC Advantage?

5 of 17

5 of 17

What is the ASIC Advantage?

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. 1 Intro
  2. 2 Motivation: Offline Attacks
  3. 3 Offline Attacks: A Common Problem
  4. 4 Desiderata: Moderately Hard Function
  5. 5 What is the ASIC Advantage?
  6. 6 Reducing ASIC Advantage
  7. 7 Data Independent Memory Hard Function (IMHF)
  8. 8 Data Independent Labeling Function GH
  9. 9 Evaluating an iMHF (red-blue pebbling)
  10. 10 Red-Blue Pebbling Cost RD17
  11. 11 What iMHFs are maximally bandwidth hard?
  12. 12 Pebbling Reduction?
  13. 13 Energy Cost of an Algorithm
  14. 14 Energy Cost of a Function
  15. 15 Pebbling Reduction: Random Oracle Model
  16. 16 Pebbling Lower Bounds
  17. 17 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.