Home > Resources > papers > HMMP23-SoK-EVoting

SoK: Secure E-Voting with Everlasting Privacy (Haines, Mosaheb, Müller, Pryvalov 2023)

Last modified: 2026-10-27

DOI: 10.56553/popets-2023-0017 · URL: https://petsymposium.org/popets/2023/popets-2023-0017.pdf

Summary

Systematizes e-voting protocols that offer everlasting privacy, i.e. ballot secrecy that survives future breaks of computational assumptions (e.g. by quantum computers), while still providing verifiability. Develops a unified framework of privacy and trust models and classifies existing schemes, typically built from perfectly hiding commitments and ZK proofs. Useful for e-ID as a reference for how unconditional privacy and public verifiability can be combined, mirroring the everlasting-privacy argument made for BBS-style credentials.