Name
Abstract | ||
|---|---|---|
In this paper, we propose further performance improvements for Wikstrom’s shuffle proof. Compared to an implementation based on general-purpose exponentiation algorithms, we show that the overall shuffle operation can be accelerated by approximately one order of magnitude. The improvements result partly from applying special-purpose algorithms for fixed-based and product exponentiations in the right way and partly from other optimization techniques. Given that shuffling is often one of the most time-consuming tasks in cryptographic voting protocols, the achieved speed-up is significant for practical implementations of electronic voting systems. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-54455-3_27 | Financial Cryptography Workshops |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rolf Haenni | 1 | 371 | 33.39 |
| Philipp Locher | 2 | 16 | 4.12 |