 |
 |
 |
Book sections
On Some Incompatible Properties of Voting Schemes
Abstract : In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. More specifically, we focus on the universal veriability of the computation of the tally, on the unconditional privacy/anonymity of the votes, and on the receipt-freeness properties, for the most classical election processes. Under usual assumptions and efficiency requirements, we show that a voting system that wants to publish the final list of the voters who actually voted, and to compute the number of times each candidate has been chosen, we cannot achieve: - universal verifiability of the tally (UV) and unconditional privacy of the votes (UP) simultaneously, unless all the registered voters actually vote; - universal verifiability of the tally (UV) and receipt- freeness (RF), unless private channels are available between the voters and/or the voting authorities.
Cited literature [22 references]
https://hal.inria.fr/inria-00539539
Contributor : David Pointcheval <>
Submitted on : Wednesday, November 24, 2010 - 3:39:22 PM
Last modification on : Wednesday, October 14, 2020 - 4:06:34 AM
Long-term archiving on: : Friday, October 26, 2012 - 4:46:21 PM
Contributor : David Pointcheval <>
Submitted on : Wednesday, November 24, 2010 - 3:39:22 PM
Last modification on : Wednesday, October 14, 2020 - 4:06:34 AM
Long-term archiving on: : Friday, October 26, 2012 - 4:46:21 PM
File
2010_vote.pdf
Files produced by the author(s)