Paper 2025/069 Original: eprint.iacr.org/2025/069 ↗
On Composing Generic Voting Schemes for Improved Privacy
Abstract
Hybrid encryption provides a way for schemes to distribute trust among many computational assumptions, for instance by composing existing schemes. This is increasingly relevant as quantum computing advances because it lets us get the best of both worlds from the privacy of the post quantum schemes and the more battle tested classical schemes. We show how to compose members of a very general class of voting schemes and prove that this preserves correctness and integrity and improves privacy compared to its constituent parts. We also show an example composition using a lattice based decryption mixnet where the improvement in privacy can indirectly lead to an improvement in integrity.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-01-16: last updated
- 2025-01-16: published
- Short URL
- https://ia.cr/2025/069
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/069,
author = {Oskar Goldhahn},
title = {On Composing Generic Voting Schemes for Improved Privacy},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/069},
year = {2025},
url = {https://eprint.iacr.org/2025/069}
}