|
|
|
|
| LEADER |
01132 am a22002173u 4500 |
| 001 |
110335 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Park, Sunoo
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Park, Sunoo
|e contributor
|
| 100 |
1 |
0 |
|a Rivest, Ronald L
|e contributor
|
| 700 |
1 |
0 |
|a Rivest, Ronald L
|e author
|
| 245 |
0 |
0 |
|a Towards secure quadratic voting
|
| 260 |
|
|
|b Springer-Verlag,
|c 2017-06-27T19:38:23Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/110335
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CCF-0939370)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CNS-1413920)
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Public Choice
|
