USENIX Security2026Top-tier venue
B-Privacy: Defining and Enforcing Privacy in Weighted Voting
Samuel Breckenridge, Dani Vilardell, Andrés Fábrega, Amy Zhao, Patrick McCorry, Ari Juels
Abstract
In traditional, one-vote-per-person voting systems, privacy equates with ballot secrecy: voting tallies are published, but individual voters' choices are concealed. Voting systems that weight votes in proportion to token holdings, though, are now prevalent in cryptocurrency and web3 systems. We show that these weighted-voting systems overturn existing notions of voter privacy. Our experiments demonstrate that even with secret ballots, publishing raw tallies often reveals voters' choices. Weighted voting thus requires a new framework for privacy. We introduce a notion called B-privacy whose basis is bribery, a key problem in voting systems today. B-privacy captures the economic cost to an adversary of bribing voters based on revealed voting tallies. We propose a mechanism to boost B-privacy by noising voting tallies. We prove bounds on its tradeoff between B-privacy and transparency, meaning reported-tally accuracy. Analyzing 3,582 proposals across 30 Decentralized Autonomous Organizations (DAOs), we find that the prevalence of large voters ("whales") limits the effectiveness of any B-Privacy-enhancing technique. However, our mechanism proves to be effective in cases without extreme voting weight concentration: among proposals requiring coalitions of ≥ 5 voters to flip outcomes, our mechanism raises B-privacy by a geometric mean factor of 4.1×. Our work offers the first principled guidance on transparency-privacy tradeoffs in weighted-voting systems, complementing existing approaches that focus on ballot secrecy and revealing fundamental constraints that voting weight concentration imposes on privacy mechanisms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d48b109d-cccf-48d1-b0c0-2997abc48378Builds on1
Related papers
- QV-net: Decentralized Self-Tallying Quadratic Voting with Maximal Ballot SecrecyZibo Zhou, Zongyang Zhang, Feng Hao, Bowen Zheng et al.CCS 2025 · 1 citation
- VoteAgain: A scalable coercion-resistant voting systemWouter Lueks, Iñigo Querejeta-Azurmendi, Carmela TroncosoUSENIX Security 2020
- Beyond Anonymity Sets: A Security Model for Distributed Shuffling in Adversarial EnvironmentsAdrian Cinal, Oliwer Sobolewski, Gabriel Wechta, Filip ZagórskiCCS 2026
- Kryvos: Publicly Tally-Hiding Verifiable E-VotingNicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke et al.CCS 2022 · 23 citations
- How Hard is Takeover in DPoS Blockchains? Understanding the Security of Coin-based Voting GovernanceChao Li, Balaji Palanisamy, Runhua Xu, Li Duan et al.CCS 2023 · 17 citations
