@inproceedings{a93101157312436db1140162a6d53249,
title = "Efficient Mixing of Arbitrary Ballots with Everlasting Privacy: How to Verifiably Mix the PPATC Scheme",
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 Wikstr{\"o}m{\textquoteright}s mixnet commonly in use is safe for use with the PPATC encryption scheme.",
keywords = "Coq, E-voting, Everlasting privacy, Verifiable shuffles",
author = "Kristian Gj{\o}steen and Thomas Haines and Solberg, \{Morten Rotvold\}",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 25th Nordic Conference on Secure IT Systems, NordSec 2020 ; Conference date: 23-11-2020 Through 24-11-2020",
year = "2021",
doi = "10.1007/978-3-030-70852-8\_6",
language = "English",
isbn = "9783030708511",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science+Business Media B.V.",
pages = "92--107",
editor = "Mikael Asplund and Simin Nadjm-Tehrani",
booktitle = "Secure IT Systems - 25th Nordic Conference, NordSec 2020, Proceedings",
address = "Netherlands",
}