Skip to main content

Secure e-Voting for Preferential Elections

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2739))

Abstract

Electronic voting (e-voting) systems can greatly enhance the efficiency, and potentially, the transparency of national elections. However, the security of such systems is an area of on-going research. The literature for secure e-voting is predominantly concerned with 1-out-of-m voting strategies, where m is the number of candidates running for the elections. This paper presents a case study of cryptologic protocols for secure e-voting systems that use preferential voting strategies.

Project funded by ARC Discovery 2002, Grant No: DP0211390

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258–273. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Australian Electoral Commission. Australian Electoral Commission (2002), Available from http://www.aec.gov.au (last accessed February 17, 2003)

  3. Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: ACM symposium on Principles of distributed computing, pp. 274–283 (2001)

    Google Scholar 

  4. Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1989)

    Google Scholar 

  5. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aditya, R., Boyd, C., Dawson, E., Viswanathan, K. (2003). Secure e-Voting for Preferential Elections. In: Traunmüller, R. (eds) Electronic Government. EGOV 2003. Lecture Notes in Computer Science, vol 2739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10929179_44

Download citation

  • DOI: https://doi.org/10.1007/10929179_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40845-1

  • Online ISBN: 978-3-540-45239-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics