Abstract
We present various trade offs for voting schemes which, compared to known solutions, allow voters to do less work at the expense of more work done by the tallying servers running the election. One such scheme produces ballots of essentially minimal size while keeping the work load on the tally servers on a practical level. Another type of trade off leads to a voting scheme that remains secure, even if an adversary can monitor all client machines used by voters to participate. This comes at the price of introducing an additional party who is trusted to carry out registration of voters correctly.
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abe: Universally verifiable MIX net with verification work independent of the number of MIX centers; proceedings of EuroCrypt 98, Springer Verlag LNCS.
Ohkubo and Abe: A Length-Invariant Hybrid Mix Proceedings of Asiacrypt 00, Springer Verlag LNCS.
Baudron, Fouque, Pointcheval, Poupard and Stern: Practical Multi-Candidate Election Scheme, manuscript, May 2000.
R. Cramer, R. Gennaro, B. Schoenmakers: A Secure and Optimally Efficient Multi-Authority Election Scheme, Proceedings of EuroCrypt 97, Springer Verlag LNCS series, pp. 103–118.
Damgård and Jurik: A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System, Proc. of Public Key Cryptography 2001, Springer Verlag LNCS series.
A. Fujioka, T. Okamoto & K. Otha: A practical secret voting scheme for large scale elections., Advances in Cryptology-Auscrypt’ 92, pp. 244–251.
B. Schoenmakers: A simple publicly verifiable secret sharing scheme and its application to electronic voting, Advances in Cryptology-Crypto’ 99, vol. 1666 of LNCS, pp. 148–164.
R. Cramer, M. Franklin, B. Schoenmakers & M. Yung: Multi-authority secret ballot elections with linear work, Advances in Cryptology-Eurocrypt’ 96, vol. 1070 of LNCS, pp. 72–83.
R. Cramer, I. Damgård and J. Nielsen:Multiparty Computation from Threshold Homomorphic Encryption, Proceedings of EuroCrypt 2001, Springer Verlag LNCS series 2045, pp.280–300.
Boudot: Efficient Proof that a Comitted Number Lies in an Interval, Proc. of EuroCrypt 2000, Springer Verlag LNCS series 1807.
Damgård and Fujisaki: An Integer Commitment Scheme based on Groups with Hidden Order, Manuscript, 2001, available from the Eprint archive.
Fujisaki and Okamoto: Statistical Zero-Knowledg Protocols to prove Modular Polynomial Relations, proc. of Crypto 97, Springer Verlag LNCS series 1294.
Oded Goldreich, Silvio Micali, and Avi Wigderson: How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 218–229, New York City, 25–27 May 1987.
M. Hirt and K. Sako: Efficient Receipt-Free Voting based on Homomorphic Encryption, Proceedings of EuroCrypt 2000, Springer Verlag LNCS series, pp. 539–556.
P. Pallier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt 99, Springer Verlag LNCS series, pp. 223–238.
J. Bar-Ilan, and D. Beaver: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds, Proceedings of the ACM Symposium on Principles of Distributed Computation, 1989, pp. 201–209.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damgård, I., Jurik, M. (2002). Client/Server Tradeoffs for Online Elections. In: Naccache, D., Paillier, P. (eds) Public Key Cryptography. PKC 2002. Lecture Notes in Computer Science, vol 2274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45664-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-45664-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43168-8
Online ISBN: 978-3-540-45664-3
eBook Packages: Springer Book Archive