Abstract
In this paper we revisit Pretty Good Democracy, a scheme for verifiable Internet voting from untrusted client machines. The original scheme was designed for first-past-the-post elections. Here, we show how Pretty Good Democracy can be extended to voting schemes in which the voter lists the candidates in their order of preference. Our scheme applies to elections using STV, IRV, Borda, or any other tallying scheme in which a vote is a list of candidates in preference order. We also describe an extension to cover Approval or Range voting.
Chapter PDF
References
Adida, B.: Helios: Web-based Open-Audit Voting (2008)
Benaloh, J., Moran, T., Naish, L., Ramchen, K., Teague, V.: Shuffle-Sum: Coercion-Resistant Verifiable Tallying for STV Voting. In: IEEE Transactions on Information Forensics and Security (2009)
Chaum, D.: SureVote: Technical Overview. In: Proceedings of the Workshop on Trustworthy Elections. In: WOTE 2001 (2001)
Clarkson, M.R., Myers, A.C.: Coercion-Resistant Remote Voting using Decryption Mixes. In: Workshop on Frontiers in Electronic Elections. In: FEE 2005 (2005)
Furukawa, J., Sako, K.: An Efficient Scheme for Proving a Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)
Groth, J.: A Verifiable Secret Shuffle of Homomorphic Encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145–160. Springer, Heidelberg (2002), Later Version at www.brics.dk/~jg/JournalShuffle2.ps
Heather, J.A.: Implementing STV Securely in Prêt à Voter. In: Proceedings of the 20th IEEE Computer Security Foundations Symposium, Venice, Italy, pp. 157–169 (July 2007)
Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant Electronic Elections. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, vol. 11 (2005)
Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, p. 162. Springer, Heidelberg (2000)
Jakobsson, M., Juels, A., Rivest, R.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In: USENIX Security Symposium, pp. 339–353 (2002)
Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer, Heidelberg (2006)
Andrew Neff, C.: A Verifiable Secret Shuffle and its Application to E-Voting. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp. 116–125. ACM Press, New York (2001)
Ryan, P.Y.A., Teague, V.: Pretty Good Democracy. In: Proceedings of the 17th International Workshop on Security Protocols, Cambridge, UK, April 2009. LNCS. Springer, Heidelberg (2009)
Ramchen, K., Teague, V.: Parallel shuffling and its application to Prêt à Voter. In: USENIX/ACCURATE Electronic Voting Technology Workshop (EVT 2010), Washington, DC (August 2010)
Ting, P.-Y., Huang, X.-W.: Distributed Paillier plaintext equivalence test. International Journal of Network Security 6(3), 258–264 (2008)
Wen, R., Buckland, R.: Minimum disclosure counting for the alternative vote. In: Ryan, P.Y.A., Schoenmakers, B. (eds.) VOTE-ID 2009. LNCS, vol. 5767, pp. 122–140. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heather, J., Ryan, P.Y.A., Teague, V. (2010). Pretty Good Democracy for More Expressive Voting Schemes. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds) Computer Security – ESORICS 2010. ESORICS 2010. Lecture Notes in Computer Science, vol 6345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15497-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-15497-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15496-6
Online ISBN: 978-3-642-15497-3
eBook Packages: Computer ScienceComputer Science (R0)