A Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems
Philipp Locher, Rolf Haenni · ARBOR - Bern University of Applied Sciences Repository · 2014
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 shuffle proof based on the proof system proposed by Wikstrom and Terelius. The implementation offers a clean and intuitive application programming interface and can be used as a lightweight cryptographic component in applications of verifiable mix-nets. Verifiable electronic voting is the most prominent target application area.