Trusted3Ballot: Improving Security and Usability of ThreeBallot Voting System using Trusted Computing

2014-01-29
Uzunay, Yusuf
BIÇAKCI, KEMAL
The main goal in the design of ThreeBallot system was to provide an end-to-end auditable voting system in a simple way without use of cryptography to bolster voter confidence in the system. However, later it was shown that this system has significant security and usability problems. To solve these problems, in this work we propose Trusted3Ballot; an electronic ThreeBallot based voting system which uses trusted computing technology. One notable feature of the proposed system is the use of TPM remote attestation property to address a number of trust and security problems. The analysis of our proposal reveals that significant improvements to the ThreeBallot system are provided in terms of both security and usability.

Suggestions

Auditable and verifiable electronic voting with homomorphic RSA tallying
Yücel, Okan; Baykal, Nazife; Department of Information Systems (2010)
In this work, we investigate the general structure and the concepts behind the contemporary electronic voting schemes, with special emphasis on voter verifiable preferential voting, homomorphic tallying and voter privacy. We firstly propose a modification in the Single Transferable Voting (STV) method to be applied to large scale elections with electoral barriers. Our proposal prevents the loss of votes and distributes them securely to the second or higher choices of their voters. This method is most suitab...
Analysis of security requirements for cryptographic voting protocols (extended abstract)
Cetinkaya, Orhan (2008-03-07)
Electronic voting refers to the use of computers or computerized voting equipment to cast ballots in an election and it is not an easy task due to the need of achieving electronic voting security requirements. The cryptographic voting protocols use advanced cryptography to make electronic voting secure and applicable.
Voter Verifiable and Single Transferable Electronic Voting for Elections with Electoral Barriers
Yucel, Okan; Baykal, Nazife (2009-06-30)
"Voter verifiability" is a notion offered by some electronic voting schemes, which develops into an important issue of democracy in the electronic world. The idea is to endow each voter with the facility of verifying that his vote is counted correctly. The check mechanism for the correct count of the vote can be provided by means of a voting receipt. On the other hand, whenever one has a receipt that serves to check the correct casting and tallying of the vote, it can also be used as the proof for the conte...
Pseudo-voter identity (PVID) scheme for e-voting protocols
Cetinkaya, Orhan; Doğanaksoy, Ali (2007-04-13)
Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communication channels anonymous in order to keep voter's identity hidden and many protocols have been proposed to construct anonymous communication channels. On the other hand, instead of making channel anonymous if we provide anonymous credentials to voter, we can easily hide voter's identity without any need of anonymous channels. This pap...
An efficient RSA public key encryption scheme
Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09)
In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...
Citation Formats
Y. Uzunay and K. BIÇAKCI, “Trusted3Ballot: Improving Security and Usability of ThreeBallot Voting System using Trusted Computing,” 2014, p. 534, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66154.