Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


Informatik 2014 P-232, 1391-1400 (2014).

Gesellschaft für Informatik, Bonn
2014


Copyright © Gesellschaft für Informatik, Bonn

Contents

A lightweight implementation of a shuffle proof for electronic voting systems

Philipp Locher and Rolf Haenni

Abstract


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 Wikström 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.1


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-626-8


Last changed 18.11.2014 21:17:57