The Implementation of a Split - Value Verifiable Voting System
نویسندگان
چکیده
This study provides a proof-of-concept of a newly designed verifiable voting system. The implementation elicits details in the communication and synchronization among servers, unavailable in the original design paper [M. O. Rabin and R. L. Rivest, "Efficient End to End Verifiable Electronic Voting Employing Split Value Representations." in Proc. EVOTE ’14, Bregenz, Austria.]. The implemented system was tested on networks of virtual machines in a cluster, and its performance was evaluated based on the computational time and amount of data transferred. The preliminary results simulates elections with up to ten thousand votes. The team will conduct further work to implement the handling of server failures and the secure channels among the servers. This study demonstrates the feasibility of running large elections with more transparent voting systems, by leveraging the split-value representation and simple cryptographic primitives.
منابع مشابه
Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking
We describe how to use Rabin’s “split-value” representations, originally developed for use in secure auctions, to efficiently implement end-to-end verifiable voting. We propose a simple and very elegant combination of split-value representations with “randomized partial checking” (due to Jakobsson et al. [16]).
متن کاملCivitas: A Secure Voting System
Civitas is the first electronic voting system that is coercion-resistant, universally and voter verifiable, and suitable for remote voting. This paper describes the design and implementation of Civitas. Assurance is established in the design through security proofs, and in the implementation through information-flow security analysis. Experimental results give a quantitative evaluation of the t...
متن کاملA Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems
In the usual setting of a verifiable mix-net, an input batch of ciphertexts is shuffled through a series of mixers into an output batch of ciphertexts while hiding the mapping between input and output and preserving the plaintexts. Unlike shuffling, proving the correctness of a shuffle is relatively expensive and difficult to implement. In this paper, we present a new implementation of a shuffl...
متن کاملCryptographically verifiable anonymous voting using pan-european e-IDs
In this paper we explore a method to create anonymous services on top of the STORK framework, to be used for electronic surveys or elections. The STORK project aims to realize a single electronic identification and authentication area across Europe. For verifiable and anonymous voting, users should be authenticated with their e-id (to prevent repeated voting) but the votes should also be anonym...
متن کاملTransparent, Auditable, and Stepwise Verifiable Online E-Voting Enabling an Open and Fair Election
Many e-voting techniques have been proposed but not widely used in reality. One of the problems associated with most existing e-voting techniques is the lack of transparency, leading to a failure to deliver voter assurance. In this work, we propose a transparent, auditable, stepwise verifiable, viewable, and mutual restraining e-voting protocol that exploits the existing multi-party political d...
متن کامل