Minimum disclosure counting for the alternative vote

8Citations
Citations of this article
245Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Although there is a substantial body of work on preventing bribery and coercion of voters in cryptographic election schemes for plurality electoral systems, there are few attempts to construct such schemes for preferential electoral systems. The problem is preferential systems are prone to bribery and coercion via subtle signature attacks during the counting. We introduce a minimum disclosure counting scheme for the alternative vote preferential system. Minimum disclosure provides protection from signature attacks by revealing only the winning candidate. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wen, R., & Buckland, R. (2009). Minimum disclosure counting for the alternative vote. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5767 LNCS, pp. 122–140). https://doi.org/10.1007/978-3-642-04135-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free