On Some Incompatible Properties of Voting Schemes

Part of book or chapter of book English OPEN
Chevallier-Mames , Benoît ; Fouque , Pierre-Alain ; Pointcheval , David ; Stern , Julien ; Traoré , Jacques (2010)
  • Publisher: springer
  • Subject: [ INFO.INFO-CR ] Computer Science [cs]/Cryptography and Security [cs.CR]
    acm: ComputingMilieux_COMPUTERSANDSOCIETY

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.
  • References (22)
    22 references, page 1 of 3

    1. M. Abe and M. Ohkubo, A Length-Invariant Hybrid Mix, Proceedings of Asiacrypt'01, volume 1976 of LNCS, pages 178-191, Springer-Verlag, 2001.

    2. R. Aditya, B. Lee, C. Boyd and E. Dawson, An efficient mixnet-based voting scheme providing receipt-freeness, Proceedings of TrustBus'04, volume 3184 of LNCS, pages 152-161, SpringerVerlag, 2004.

    3. O. Baudron, P.-A Fouque, D. Pointcheval, G. Poupard and J. Stern, Practical multi-candidate election system, Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, pages 274-283, ACM Press, 2001.

    4. J. Benaloh and D. Tuinstra, Receipt-free secret ballot elections, Proceedings of STOC'94, volume 1976 of LNCS, pages 544-553, 1994.

    5. R. Cramer and M. Franklin and B. Schoenmackers and Moti Yung. Multi-Authority Secret-Ballot Elections with Linear Work. Eurocrypt '96, LNCS 1070, pp. 72-83, 1996.

    6. R. Cramer, R. Gennaro and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of Eurocrypt'97, volume 1233 of LNCS, pages 113-118, SpringerVerlag, 1997.

    7. I. Damgard and M. Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System, Proceedings of PKC'01, volume 1992 of LNCS, pages 119-136, Springer-Verlag, 2001.

    8. A. Fujioka, K. Ohta and T. Okamoto, A practical Secret Voting Scheme for Large Scale Elections, Proceedings of Auscrypt'92, volume 718 of LNCS, pages 248-259. Springer-Verlag, 1992.

    9. J. Furukawa, Efficient, verifiable shuffle decryption and its requirement of unlinkability. Proceedings of PKC'04, volume 2947 of LNCS, pages 319-332, Springer-Verlag, 2004.

    10. J. Furukawa and K. Sako, An Efficient Scheme for Proving a Shuffle. Proceedings of Crypto'01, volume 2139 of LNCS, pages 368-387, Springer-Verlag, 2001.

  • Metrics
    No metrics available
Share - Bookmark