Paper 2025/069

On Composing Generic Voting Schemes for Improved Privacy

Oskar Goldhahn, Norwegian University of Science and Technology
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.
Keywords
e-votinghybrid quantum-classicalPQC
Contact author(s)
oskar goldhahn @ ntnu no
History
2025-01-17: approved
2025-01-16: received
See all versions
Short URL
https://ia.cr/2025/069
License
Creative Commons Attribution
CC BY

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}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.