Private aggregation at scale with decentralized trust
summary
Designs enable private aggregation with a single untrusted server by shifting trust to the client population: Flamingo uses two-round semi-honest / three-round malicious protocols where clients mask vectors with PRG-expanded pairwise secrets on a sparse graph and the server unmasking uses threshold decryption with small committee (iteration-specific secrets, one-time setup), cutting server wait time up to ~8x. Armadillo adds robustness: clients use key-homomorphic encryption and send inner-product ZK proofs for norm checks so the server learns the sum of valid reports despite malicious clients, but privacy requires a majority of honest clients.
AI-written summary · about
chapters (10)
- 0:00Private aggregation in federated learning
- 2:08Single-server private aggregation challenges
- 7:11Multi-round protocol bottlenecks
- 9:21Two-phase aggregation paradigm
- 12:14Flamingo protocol design
- 18:19Flamingo performance gains
- 22:13Armadillo robustness
- 25:05Zero-knowledge in Armadillo
- 28:41Open problems and future work
- 30:04Conclusion
related talks
27mMetadata-private data transfer
15mProduction Multi-Party Computation via the Distributed Aggregation Protocol
31mAggregatable Distributed Key Generation
56mCollaborative zk-SNARKs: Proving as One over Distributed Secrets
28mScalable Privacy
01h 08mSecure Computation 1
28mAsynchronous Distributed Key Generation
01h 10mSecure Multiparty Computation II
