Towards Scalable Threshold Cryptosystems

on YouTube ↗33m

" summary

Provides concrete algorithms and measurements: uses KZG commitments plus a polynomial multi-point evaluation to build an authenticated multi-point evaluation tree that drops VSS dealing from impractical (claimed “year”-scale in the naive baseline) to minutes and seconds in experiments, and replaces quadratic aggregation (O(t^2)) for BLS/Lagrange interpolation with O(t log^2 t) (turning tens of hours into tens of seconds at extreme scale, and minutes into ~1–2 s at large scale). Implementation and data sit in a public GitHub repo.

AI-written summary · about

" chapters (17)

1. 0:00Introduction
2. 1:30Motivation
3. 2:15Threshold Signatures
4. 3:43Why Threshold Signatures
5. 4:46Two Challenges
6. 6:43Secret Sharing
7. 8:09verifiable secret sharing
8. 11:52polynomial multipoint evaluation
9. 14:19scaling aggregation
10. 15:04bls threshold signature
11. 17:24Summary
12. 18:36Extra Time
13. 19:26FK VSS
14. 22:46Conclusion
15. 27:14Public Parameters
16. 28:05Intuitive Explanation
17. 28:56Generalization

" related talks

• 01h 04mUsing Lattices for CryptanalysisNadia Heninger · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 57mAlgorithms for Lattice Problems, in PracticeElena Kirshanova, Pierre-Alain Fouque · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 13mSurvey of Privacy Solutions for Minimizing MEVMikerah · MEV.wtf Summit 2021
• 52mFaster, Smaller, Weaker, DarkerBenedikt Bunz · Proofs, Consensus, and Decentralizing Society Reunion 2020
• 40mPost-QuantumJames Howe, Thomas Prest, Thijs Laarhoven, Corentin Jeudy · RSAC 2021
• 01h 06mFrom Theory to Practice - Threshold CryptographyTal Rabin · Large-Scale Consensus and Blockchains 2019
• 01h 08mCryptography from Ideal LatticesDamien Stehlé · The Mathematics of Modern Cryptography
• 01h 40mHistorical Talk on Lattice-Based CryptographyDaniele Micciancio · The Mathematics of Modern Cryptography