Skip to Main content Skip to Navigation
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.
Document type :
Book sections
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

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

File

2010_vote.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00539539, version 1

Collections

Citation

Benoît Chevallier-Mames, Pierre-Alain Fouque, David Pointcheval, Julien Stern, Jacques Traoré. On Some Incompatible Properties of Voting Schemes. D. Chaum, R. Rivest, M. Jakobsson, B. Schoenmakers, P. Ryan, and J. Benaloh. Towards Trustworthy Elections, 6000, springer, pp.191--199, 2010, lncs. ⟨inria-00539539⟩

Share

Metrics

Record views

1034

Files downloads

853