The implementation of a split-value verifiable voting system

Abstract

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.