Page 180 - Towards Trustworthy Elections New Directions in Electronic Voting by Ed Gerck (auth.), David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida ( (z-lib.org (1)

A. Kiayias and M. Yung
172
Remark. It has been brought to our attention that a scheme related to the
punch-hole approach (without the combination of vector-ballots/ write-in votes)
appeared in the Ph.D. Thesis of M. Hirt [28].
Space-Time Tradeoffs. It is possible to obtain a hybrid between the standard
paradigm and the punch-hole by having a vector of registers of smaller capacity
that will be aggregating the votes for small subsets of candidates (as opposed
to a single candidate in the punch-hole case above). This yields an immediate
space-time tradeoff in terms of encrypted ballot encoding and time to recover
the result.
Acknowledgement. We thank Ron Rivest for his motivating question regard-
ing homomorphic encryption and writein ballot combination and to Pierre-Alain
Fouque for getting it to our attention and for related discussions.

References

1. Abe, M., Hoshino, F.: Remarks on Mix-Networks Based on Permutation Networks.
In: PKC 2001 (2001)
2. Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical
Multi-Candidate Election system. In: The Proceedings of the ACM Symposium on
Principles of Distributed Computing PODC (2001)
3. Benaloh, J.: Verifiable Secret-Ballot Elections, PhD Thesis, Yale University (1987)
4. Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the
Privacy of Voters. In: The proceedings of the ACM Symposium on Principles of
Distributed Computing PODC (1986)
5. Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: STOC 1994
(1994)
6. Boneh, D., Golle, P.: Almost Entirely Correct Mixing With Applications to Voting.
In: 9th ACM-CCS Conference (2002)
7. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital
Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)
8. Chaum, D.: Blind Signatures for Untraceable Payments. In: CRYPTO 1982,
pp. 199–203 (1982)
9. Chaum, D.: Elections with unconditionally-secret ballots and disruption equivalent
to breaking RSA. In: G¨unther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330,
pp. 177–182. Springer, Heidelberg (1988)
10. Cohen (Benaloh), J.D., Fischer, M.J.: A Robust and Verifiable Cryptographically
Secure Election Scheme. In: FOCS 1985 (1985)
11. Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient
multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS,
vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
12. Cramer, R., Damg˚ard, I.B., Schoenmakers, B.: Proof of partial knowledge and
simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO
1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)
13. Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-authority secret-
ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996.
LNCS, vol. 1070, pp. 72–83. Springer, Heidelberg (1996)