Cryptology ePrint Archive: Report 2019/1193

Security models for everlasting privacy

Panagiotis Grontas and Aris Pagourtzis and Alexandros Zacharakis

Abstract: We propose security models for everlasting privacy, a property that protects the content of the votes cast in electronic elections against future and powerful adversaries. Initially everlasting privacy was treated synonymously with information theoretic privacy and did not take advantage of the information available to the adversary and his behavior during or after the election. More recent works provided variations of the concept, limiting the view of the future adversary to publicly available data. We consider an adversary that potentially has insider access to private election data as well. We formally express our adversarial model in game based definitions build on top of a generic voting scheme. This allows us to define a stronger version of everlasting privacy and contrast the two main proposals to achieve it, namely perfectly hiding commitment schemes and anonymous channels.

Category / Keywords: applications / Electronic voting, everlasting privacy, perfectly hiding commitment schemes, blind signatures, anonymous channels

Original Publication (with minor differences): E-Vote-ID 2019 (4th International Joint Conference on Electronic Voting, 1-4 October 2019, Lochau Bregenz, Austria)

Date: received 13 Oct 2019

Contact author: pgrontas at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20191015:074626 (All versions of this report)

Short URL: ia.cr/2019/1193


[ Cryptology ePrint archive ]