Conference Proceedings

Public evidence from secret ballots

M Bernhard, J Benaloh, J Alex Halderman, RL Rivest, PYA Ryan, PB Stark, V Teague, PL Vora, DS Wallach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | springer | Published : 2017


© 2017, Springer International Publishing AG. Elections seem simple—aren’t they just about counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results are correct; and the secrecy of the ballot must be ensured. They also have practical constraints: time is of the essence, and voting systems need to be affordable and maintainable, as well as usable by voters, election officials, and pollworkers. It is thus not surprising that voting is a rich research area spanning theory, applied cryptography, practical systems analysis, usable security, and statistics. E..

View full abstract

Citation metrics