Aggios: Scalable Aggregator-Based Voting
summary
Aggios proposes an aggregator-based election where voters send ballots to chosen aggregators, aggregators publish blinded polynomial commitments and ZK inclusion proofs, and validators (a blockchain) check an accumulator-style zero-knowledge proof that the union of disjoint subsets equals the voter set. Construction generalizes lookup-table ZK tricks with a grand-product to force one-to-one mappings; proving time is O(n) over the full table while proof size and verification cost scale with number of subsets, not voters, and uses aggregatable signatures.
AI-written summary · about
chapters (6)
- 0:00Introduction
- 5:45Aggregator-based voting benefits
- 11:50Cryptographic accumulator challenges
- 17:37Generalizing lookup arguments
- 25:30Voting protocol with commitments
- 30:10Q&A
related talks
57mPractical Groth16 Aggregation
26mA formal security analysis of Blockchain voting
20mVerifiable Elections—Now Is the Time
25mSuccinct Proofs in Ethereum
22mDIZK: A Distributed Zero Knowledge Proof System
24mEnhancing Protocol Security With ZK-Oracles
26mApplications of Zero Knowledge Proofs in the Banking Industry
52mDiscrete Log based Zero-Knowledge Proofs