Journal article

Shuffle-Sum: Coercion-Resistant Verifiable Tallying for STV Voting

Josh Benaloh, Tal Moran, Lee Naish, Kim Ramchen, Vanessa Teague

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2009

Abstract

There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favorite. However, these schemes inherently suffer from a coercion problem when there are many candidates, because a coercer can demand a certain permutation from a voter and then check whether that permutation appears during tallying. Recently developed cryptographic voting protocols allow anyone to audit an election (universal verifiability), but existing systems are either not applicable to ranked voting at all, or reveal enough information about the ballots to make voter coercion possible. We solve this problem for the popular single transferable vote (STV) ranked vot..

View full abstract

University of Melbourne Researchers