[Resource Topic] 2025/1482: Complex Elections via Threshold (Fully) Homomorphic Encryption

Welcome to the resource topic for 2025/1482

Title:
Complex Elections via Threshold (Fully) Homomorphic Encryption

Authors: Charlotte Bonte, Georgio Nicolas, Nigel P. Smart

Abstract:

We discuss how Fully Homomorphic Encryption (FHE), and in particular the TFHE scheme, can be used to define an e-voting scheme for the Alternative Vote (AV) election system. This system has a more complex tallying phase than traditional First-Past-The-Post (FPTP) election variants. Previous work on e-voting schemes that used homomorphic encryption has focused on FPTP systems only, and utilized mainly linearly homomorphic encryption. We show, by using FHE, that more complex electoral systems such as AV can also be supported by homomorphic encryption. We show security of our protocol by considering it as a simple MPC functionality, and we also show practicality by presenting some experimental runtimes using the tfhe-rs library.

ePrint: https://eprint.iacr.org/2025/1482

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .