Secure e-Voting for Preferential Elections
- 1k Downloads
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.
Unable to display preview. Download preview PDF.
- 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