Receipt-Free K-out-of-L Voting

Martin Hirt (ETH)

We present a simple framework which allows to construct electronic voting schemes based on homomorphic encryption. The framework abstracts from the actual encryption function; it just requires few properties which are satisfied by known homomorphic public-key encryption schemes like ElGamal and Paillier.

Then, we construct an efficient K-out-of-L voting scheme within this framework, in which every voter can vote for K candidates from a list of L candidates. Finally, this scheme is extended to prevent voters from selling their votes (receipt-freeness). This yields the first receipt-free K-out-of-L voting scheme with complexity polynomial in K and L.