Performance of Shuffling: Taking it to the Limits

Haenni, Rolf; Locher, Philipp (2010). Performance of Shuffling: Taking it to the Limits In: Financial Cryptography and Data Security, International Workshops. LNCS: Vol. 12063 (pp. 369-385). Springer

Text HL20.pdf - Accepted Version Restricted to registered users only Available under License Publisher holds Copyright. Download (577kB) | Request a copy

In this paper, we propose further performance improvements for Wikström’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.

Item Type:	Conference or Workshop Item (Paper)
Division/Institute:	School of Engineering and Computer Science > Research Institute for the Security in the Information Society RISIS > RISIS / E-Voting Group School of Engineering and Computer Science > Institute for Cybersecurity & Engineering (ICE) > ICE / E-Voting Group
Name:	Haenni, Rolf and Locher, Philipp
Subjects:	Q Science > QA Mathematics > QA76 Computer software
ISBN:	978-3-030-54454-6
Series:	LNCS
Publisher:	Springer
Language:	English
Submitter:	Rolf Haenni
Date Deposited:	23 Dec 2020 11:18
Last Modified:	23 Dec 2020 11:18
ARBOR DOI:	10.24451/arbor.13833
URI:	https://arbor.bfh.ch/id/eprint/13833