Completed
Lattice basis compression [SMSV14]
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Crypto 2023 Best Paper Plenary - Fast Lattice Reduction and Adaptive Schnorr Signatures
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 The "Two Faces" of lattice reduction [NS01]
- 3 Lattice reduction is a cryptanalytic bottleneck
- 4 Example: Gentry-Halevi FHE [GH11]
- 5 LLL reduction finds a good basis
- 6 Fast lattice reduction strategies
- 7 Towards faster lattice reduction [KEF21]
- 8 Lattice basis compression [SMSV14]
- 9 Lattice reduction with iterated compression
- 10 Is our algorithm numerically stable?
- 11 Is our algorithm fast?
- 12 Implementation - flatter
- 13 Experiment: q-ary lattices
- 14 Experiment: Gentry-Halevi FHE [GH11]
- 15 Experiment: RSA partial factorization [How01]
- 16 Further applications
- 17 Why Schnorr signatures?
- 18 What are threshold signatures?
- 19 Why multi-party Schnorr signatures? Why
- 20 Main Goals
- 21 2-Round Threshold Scheme
- 22 Concurrent Security: ROS Attacks NKDMOS
- 23 Recent Schnorr Threshold Signatures
- 24 Concurrent Adaptive Security
- 25 Adaptive Security is Challenging
- 26 Sparkle
- 27 Adaptive Security under (A)OMDL
- 28 Key Takeaways
