dos Santos Araujo, Roberto Samarone
On Remote and Voter-Verifiable Voting.
Technische Universität, Darmstadt
[Ph.D. Thesis], (2008)
This is the latest version of this item.
Available under Creative Commons Attribution Non-commercial No Derivatives, 2.5.
Download (976kB) | Preview
|Item Type:||Ph.D. Thesis|
|Title:||On Remote and Voter-Verifiable Voting|
Voting is an important tool for modern societies. It is fundamental for the democracy. This mechanism must be fair and accurate. However, threats intrinsic in the voting process may compromise these requisites. In conventional voting, dishonest talliers may corrupt the ballot box, for instance. Remote voting has more threats due to the uncontrolled environment. In this work, we propose secure protocols for polling station and remote voting with attractive properties. Voter-verifiability is a novel security feature provided by recent voting systems. It allows voters to confirm that their votes are accurately counted in the tally. These systems provide better security guarantees than the conventional ones as voters are able to detect corruptions of votes and counting errors. They usually rely on cryptography to implement this feature. We introduce a novel concept of ballot box based on the Farnel approach. It provides voters, when they cast their votes, with one or more random selected receipts. This allows a different notion of voter-verifiability in which the voter may verify one or more random votes. The idea has a number of attractive features: ballot secrecy is achieved up front and does not have to be provided by anonymising mixes during tabulation. Also, it mitigates randomization attacks that are inherent in some voter-verifiable schemes. Based on the new ballot box, we introduce three new voter-verifiable paper-based schemes. One of these schemes does not employ cryptography and thus can be more easily understood by the average voter. The others require just a single cryptographic primitive and achieve better security guarantees. In addition to these schemes, we propose improvements to the Threeballot and Randell-Ryan voting protocols. These schemes are voter-verifiable and do not employ cryptography. However, they ensure less guarantees than cryptographic based systems. The voter-verifiable schemes given consider a controlled environment as conventional voting. Remote Internet voting, however, has many benefits over the conventional ones and is challenging. Although the existing technology render possible such voting, it has a number of associated threats as coercion and vote selling. We also propose a new scheme for remote Internet voting. The proposal mitigates coercive attacks and is more efficient for large scale voting than the previous solutions.
|Place of Publication:||Darmstadt|
|Uncontrolled Keywords:||Security, Voting Protocols, Internet Voting, Paper-based Voting, Coercion-resistant, Voter-verifiability, End-to-end Verifiability|
|Classification DDC:||500 Naturwissenschaften und Mathematik > 500 Naturwissenschaften
000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik
|Divisions:||20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra|
|Date Deposited:||17 Dec 2008 13:19|
|Last Modified:||07 Dec 2012 11:54|
|Referees:||Buchmann, Dr. Johannes and Yvain Anthony Ryan, Dr. Peter|
|Refereed:||25 September 2008|
Available Versions of this Item
- On Remote and Voter-Verifiable Voting. (deposited 17 Dec 2008 13:19) [Currently Displayed]