Asynchronous Distributed Key Generation

on YouTube ↗28m

" summary

Builds an asynchronous DKG that replaces a trusted dealer with a two-dimensional secret sharing scheme (bivariate polynomials) that separates safety and liveness quorums so the threshold key is safe against up to f corrupted nodes while remaining live with f+1 participants. Produces a weak DKG with eventual agreement and monotone predictions, which yields an eventual common coin via threshold signatures; at most f sequence numbers can disagree. Worst-case binary agreement costs O(n^4) when adversary triggers all f disagreements, otherwise it amortizes to optimal complexity.

AI-written summary · about

" chapters (11)

1. 0:00Start
2. 0:43Scalable Consensus Algorithms
3. 2:09Primer in Secret Sharing
4. 2:55Threshold Signatures
5. 3:22Why? [Partial Synchrony]
6. 8:30High-Threshold AVSS
7. 8:51HAVSS - Threshold 2f+1
8. 10:52HAVSS - Properties
9. 12:29weak Distributed Key Generation
10. 19:39Asynchronous DKG
11. 27:27Applications

" related talks

• 31mAggregatable Distributed Key GenerationMary Maller · Real-World Decentralized Cryptography Workshop 2021
• 27mAsynchronous Distributed Key GenerationEleftherios Kokoris-Kogias · Real-World Decentralized Cryptography Workshop 2021
• 01h 10mSecure Multiparty Computation IIYuval Ishai · Cryptography Boot Camp 2015
• 26mBaby Sharks: Small Subgroup Attacks on DKG ImplementationsOmer Shlomovits · Real-World Decentralized Cryptography Workshop 2021
• 01h 14mDecentralized Cryptography: A Distant Dream or an Immediate Possibility?Andrew Miller, Harry Halpin, Aniket Kate, Ittai Ibrahim, Christian Cachin · Real-World Decentralized Cryptography Workshop 2021
• 40mCryptography in Distributed SystemsHamidreza Khoshakhlagh · RSAC 2021
• 46mKey AgreementDoreen Riepel, Marjan Skrobot · RSA Conference 2023
• 34mEfficient Robust Private Aggregation for DPKunal Talwar · Trust in Decentralized Systems 2026