Paper 2019/1193

Security models for everlasting privacy

Panagiotis Grontas, 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.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. Minor revision. E-Vote-ID 2019 (4th International Joint Conference on Electronic Voting, 1-4 October 2019, Lochau Bregenz, Austria)
Keywords
Electronic votingeverlasting privacyperfectly hiding commitment schemesblind signaturesanonymous channels
Contact author(s)
pgrontas @ gmail com
History
2019-10-15: received
Short URL
https://ia.cr/2019/1193
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1193,
      author = {Panagiotis Grontas and Aris Pagourtzis and Alexandros Zacharakis},
      title = {Security models for everlasting privacy},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1193},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1193}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.