Improving the Performance of Cryptographic Voting Protocols

Haenni, Rolf; Locher, Philipp; Gailly, Nicolas (2019). Improving the Performance of Cryptographic Voting Protocols In: Voting'19, 4th Workshop on Advances in Secure Electronic Voting. LNCS: Vol. 11599 (pp. 272-288). Springer 10.1007/978-3-030-43725-1_19

[img]
Preview
Text
paper.pdf - Accepted Version
Available under License Publisher holds Copyright.

Download (616kB) | Preview

Cryptographic voting protocols often rely on methods that require a large number of modular exponentiations. Corresponding performance bottlenecks may appear both on the server and the client side. Applying existing optimization techniques is often mentioned and rec- ommended in the literature, but their potential has never been analyzed in depth. In this paper, we investigate existing algorithms for computing fixed-base exponentiations and product exponentiations. Both of them appear frequently in voting protocols. We also explore the potential of applying small-exponent techniques. It turns out that using these techniques in combination, the overall computation time can be reduced by two or more orders of magnitude.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

Engineering and Information Technology > Research Institute for the Security in the Information Society RISIS
Engineering and Information Technology

Name:

Haenni, Rolf;
Locher, Philipp and
Gailly, Nicolas

Subjects:

Q Science > QA Mathematics > QA75 Electronic computers. Computer science

ISBN:

978-3-030-43724-4

Series:

LNCS

Publisher:

Springer

Language:

English

Submitter:

Rolf Haenni

Date Deposited:

09 Jan 2020 10:34

Last Modified:

01 Apr 2021 02:30

Publisher DOI:

10.1007/978-3-030-43725-1_19

Related URLs:

ARBOR DOI:

10.24451/arbor.9552

URI:

https://arbor.bfh.ch/id/eprint/9552

Actions (login required)

View Item View Item
Provide Feedback