Towards secure quadratic voting

Author(s)
Park, Sunoo; Rivest, Ronald L
Thumbnail
Download11127_2017_407_ReferencePDF.pdf (167.4Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We provide an overview of some of the security issues involved in securely implementing Lalley and Weyl’s “Quadratic Voting” (Lalley and Weyl, Quadratic voting, 2016), and suggest some possible implementation architectures. Our proposals blend end-to-end verifiable voting methods with anonymous payments. We also consider new refund rules for quadratic voting, such as a “lottery” method.
Date issued
2017-02
URI
http://hdl.handle.net/1721.1/110335
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Public Choice
Publisher
Springer-Verlag
Citation
Park, Sunoo and Rivest, Ronald L. “Towards Secure Quadratic Voting.” Public Choice 172, 1–2 (February 2017): 151–175 © 2017 Springer Science+Business Media New York
Version: Author's final manuscript
ISSN
0048-5829
1573-7101
Collections