Electronic voting has seen a surge of growth in the US over the past five years; yet many questions have been raised about the trustworthiness of today's e-voting systems. One solution that has been proposed involves use of sophisticated cryptographic protocols to prove to voters that their vote has been recorded and counted correctly. These protocols are of interest both for their use of many fundamental tools in cryptography (e.g., zero-knowledge proofs, mixnets, threshold cryptosystems) as well as because of the social importance of the problem. I will survey some promising recent work in this area, discuss several open problems for future research, and suggest some ways that cryptographers might be able to contribute to improving the integrity of public elections. © International Association for Cryptologic Research 2006.
CITATION STYLE
Wagner, D. (2006). Cryptographic protocols for electronic voting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4117 LNCS, p. 393). Springer Verlag. https://doi.org/10.1007/11818175_23
Mendeley helps you to discover research relevant for your work.