Name
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 Wikstrom 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. |
Year | Venue | Field |
|---|---|---|
2014 | GI Jahrestagung | Electronic voting,Cryptography,Computer science,Correctness,Input/output,Theoretical computer science,Shuffling,Verifiable secret sharing,Application programming interface |
DocType | Citations | PageRank |
Conference | 2 | 0.45 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philipp Locher | 1 | 16 | 4.12 |
| Rolf Haenni | 2 | 371 | 33.39 |