On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

TheIACR via YouTube Direct link

Remove random challenge

17 of 18

17 of 18

Remove random challenge

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Motivation: Password Hashing
  3. 3 Moderately hard F
  4. 4 Traditional cost metric: Time
  5. 5 Sequential Memory Hardness[Per09]
  6. 6 Designing sequential memory-hard functions
  7. 7 Sequential Memory hard functions: ROMix[Per 09] Phase 1
  8. 8 Cumulative Memory Complexity/A515
  9. 9 Memory hardness, revisited
  10. 10 Entangled Adversary
  11. 11 Generalization
  12. 12 Model MHF by Pebblingtas15
  13. 13 Reduction
  14. 14 Randomized Pebbling game
  15. 15 Key lemma
  16. 16 Potential
  17. 17 Remove random challenge
  18. 18 Wrap-up

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.