Aggregatable Distributed Key Generation
summary
New DKG construction is publicly verifiable, uses encrypted secret-share outputs plus non-interactive proofs so there are no complaint rounds, and it aggregates per-party ciphertexts into aggregateable transcripts via a gossip/merge protocol that reduces O(n^2) raw encryptions to a single constant-size verification message after logarithmic rounds and one final broadcast. Secrets are group-element secrets, so the scheme yields a two–group-element VRF/unique-threshold primitive with three pairings per verify, and security proofs avoid rewinding under a static adversary.
AI-written summary · about
chapters (7)
related talks
28mAsynchronous Distributed Key Generation
54mFine-Grained Cryptography
34mEfficient Robust Private Aggregation for DP
40mCryptography in Distributed Systems
30mDistributed Aggregation Protocol: A Standard for Privacy-Preserving Aggregation in MPC
46mKey Agreement
31mSecure Distributed Storage
32mPrivate aggregation at scale with decentralized trust