Receipt-Free K-out-of-L Voting Based on ElGamal Encryption

Martin Hirt

Towards Trustworthy Elections, Lecture Notes in Computer Science, Springer-Verlag, vol. 6000, pp. 64–82, Jun 2010.

We present a $K$ -out-of- $L$ voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) $K$ candidates from a set of $L$ candidates. The scheme is receipt-free, which means that even a malicious voter cannot prove to anybody how he voted. Furthermore, the scheme can be based on any semantically secure homomorphic encryption scheme, in particular also on the modified ElGamal encryption scheme which does not allow for efficient decryption of arbitrary large messages (but is more efficient than Paillier's encryption scheme).

We note that in contrast to the standard setting with receipts, in a receipt-free setting a $K$ -out-of- $L$ voting scheme cannot be derived directly from a yes/no voting scheme.

Finally, we show that the voting protocol of Lee and Kim is not receipt-free, opposed to what is claimed in the paper.

BibTeX Citation

@incollection{Hirt10,
    author       = {Martin Hirt},
    title        = {Receipt-Free {K-out-of-L} Voting Based on ElGamal Encryption},
    editor       = {David Chaum and Markus Jakobsson and Ronald L. Rivest and Peter Y.A. Ryan and Josh Benaloh and Miroslaw Kutylowski and Ben Adida},
    booktitle    = {Towards Trustworthy Elections},
    pages        = {64--82},
    series       = {Lecture Notes in Computer Science},
    volume       = {6000},
    year         = {2010},
    month        = {6},
    publisher    = {Springer-Verlag},
}