Paper 2024/1513
Depth Optimized Circuits for Lattice Based Voting with Large Candidate Sets
, Norwegian University of Science and TechnologyAbstract
Homomorphic encryption has long been used to build voting schemes. Additively homomorphic encryption only allows simple count- ing functions. Lattice-based fully (or somewhat) homomorphic encryp- tion allows more general counting functions, but the required parameters quickly become impractical if used naively. It is safe to leak information during the counting function evaluation, as long as the information could be derived from the public result. To exploit this observation, we de- sign a flexible framework for using somewhat homomorphic encryption for voting that incorporates random input and allows controlled leakage of information. We instantiate the framework using novel circuits with low but significant multiplicative depth exploiting the fact that, in the context of voting, leakage of certain information during homomorphic evaluation can be permitted. We also instantiate the framework with a circuit that uses random input to shuffle without the use of mixnets.
Note: prefer published version and increase displayed number of authors in bibliography
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- e-votingPQCFHE
- Contact author(s)
-
oskar goldhahn @ ntnu no
kristian gjosteen @ ntnu no - History
- 2024-10-07: revised
- 2024-09-26: received
- See all versions
- Short URL
- https://ia.cr/2024/1513
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1513,
author = {Oskar Goldhahn and Kristian Gjøsteen},
title = {Depth Optimized Circuits for Lattice Based Voting with Large Candidate Sets},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1513},
year = {2024},
url = {https://eprint.iacr.org/2024/1513}
}
