Towards a formal analysis of information leakage for signature attacks in preferential elections

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

Abstract

Electronic voting is rich with paradoxes. How can a voter verify that his own vote has been correctly counted, but at the same time be prevented from revealing his vote to a third party? Not only is there no generally recognised solution to those problems, it is not generally agreed how to specify precisely what the problems are, and what exact threats they pose. Such a situation is ripe for the application of Formal Methods. In this paper we explore so-called signature attacks, where an apparently secure system can nevertheless be manipulated to reveal a voter's choice in unexpected and subtle ways. We describe two examples in detail, and from that make proposals about where formal techniques might apply. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Wen, R., McIver, A., & Morgan, C. (2014). Towards a formal analysis of information leakage for signature attacks in preferential elections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8442 LNCS, pp. 595–610). Springer Verlag. https://doi.org/10.1007/978-3-319-06410-9_40

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