TY - GEN
T1 - Optimal Randomized Partial Checking for Decryption Mix Nets
AU - Haines, Thomas
AU - Müller, Johannes
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - One of the most important verifiability techniques for mix nets is randomized partial checking (RPC). This method is employed in a number of prominent secure e-voting systems, including Prêt à Voter, Civitas, and Scantegrity II, some of which have also been used for real political elections including in Australia. Unfortunately, it turned out that there exists a significant gap between the intended and the actual verifiability tolerance of the original RPC protocol. This mismatch affects exactly the “Achilles heel” of RPC, namely those application scenarios where manipulating a few messages can swap the final result (e.g., in close runoff elections). In this work, we propose the first RPC protocol which closes the aforementioned gap for decryption mix nets. We prove that our new RPC protocol achieves an optimal verifiability level, without introducing any disadvantages. Current implementations of RPC for decryption mix nets, in particular for real-world secure e-voting, should adopt our changes to improve their security.
AB - One of the most important verifiability techniques for mix nets is randomized partial checking (RPC). This method is employed in a number of prominent secure e-voting systems, including Prêt à Voter, Civitas, and Scantegrity II, some of which have also been used for real political elections including in Australia. Unfortunately, it turned out that there exists a significant gap between the intended and the actual verifiability tolerance of the original RPC protocol. This mismatch affects exactly the “Achilles heel” of RPC, namely those application scenarios where manipulating a few messages can swap the final result (e.g., in close runoff elections). In this work, we propose the first RPC protocol which closes the aforementioned gap for decryption mix nets. We prove that our new RPC protocol achieves an optimal verifiability level, without introducing any disadvantages. Current implementations of RPC for decryption mix nets, in particular for real-world secure e-voting, should adopt our changes to improve their security.
KW - E-voting
KW - Mix nets
KW - RPC
KW - Verifiability
UR - http://www.scopus.com/inward/record.url?scp=85120071092&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-90567-5_14
DO - 10.1007/978-3-030-90567-5_14
M3 - Conference contribution
SN - 9783030905668
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 277
EP - 292
BT - Information Security and Privacy - 26th Australasian Conference, ACISP 2021, Proceedings
A2 - Baek, Joonsang
A2 - Ruj, Sushmita
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th Australasian Conference on Information Security and Privacy, ACISP 2021
Y2 - 1 December 2021 through 3 December 2021
ER -