A lightweight implementation of a shuffle proof for electronic voting systems
| dc.contributor.author | Locher, Philipp | |
| dc.contributor.author | Haenni, Rolf | |
| dc.contributor.editor | Plödereder, E. | |
| dc.contributor.editor | Grunske, L. | |
| dc.contributor.editor | Schneider, E. | |
| dc.contributor.editor | Ull, D. | |
| dc.date.accessioned | 2017-07-26T10:58:34Z | |
| dc.date.available | 2017-07-26T10:58:34Z | |
| dc.date.issued | 2014 | |
| dc.description.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 | en |
| dc.identifier.isbn | 978-3-88579-626-8 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Informatik 2014 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-232 | |
| dc.title | A lightweight implementation of a shuffle proof for electronic voting systems | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 1400 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 1391 | |
| gi.conference.date | 22.-26. September 2014 | |
| gi.conference.location | Stuttgart |
Dateien
Originalbündel
1 - 1 von 1