Welcome to the resource topic for 2020/1331
Title:
Efficient mixing of arbitrary ballots with everlasting privacy: How to verifiably mix the PPATC scheme
Authors: Kristian Gjøsteen, Thomas Haines, Morten Rotvold Solberg
Abstract:The long term privacy of voting systems is of increasing concern as quantum computers come closer to reality. Everlasting privacy schemes offer the best way to manage these risks at present. While homomorphic tallying schemes with everlasting privacy are well developed, most national elections, using electronic voting, use mixnets. Currently the best candidate encryption scheme for making these kinds of elections everlastingly private is PPATC, but it has not been shown to work with any mixnet of comparable efficiency to the current ElGamal mixnets. In this work we give a paper proof, and a machine checked proof, that the variant of Wikstrom’s mixnet commonly in use is safe for use with the PPATC encryption scheme.
ePrint: https://eprint.iacr.org/2020/1331
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .