Short Ballot Assumption and Threeballot Voting Protocol

  • Jacek Cichoń
  • Mirosław Kutyłowski
  • Bogdan Wȩglorz
Conference paper

DOI: 10.1007/978-3-540-77566-9_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4910)
Cite this paper as:
Cichoń J., Kutyłowski M., Wȩglorz B. (2008) Short Ballot Assumption and Threeballot Voting Protocol. In: Geffert V., Karhumäki J., Bertoni A., Preneel B., Návrat P., Bieliková M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg

Abstract

We analyze the Threeballot voting system proposed recently by R. Rivest. We investigate the relation between the number of the candidates in a race and effectiveness of Strauss’ attack. We also show that in a reasonable scenario it is impossible to reconstruct voters’ preferences for a single race with two candidates.

Keywords

e-voting anonymity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jacek Cichoń
    • 1
  • Mirosław Kutyłowski
    • 1
  • Bogdan Wȩglorz
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of Technology 

Personalised recommendations