Home > Research > Publications & Outputs > Towards everlasting privacy and efficient coerc...

Links

Text available via DOI:

View graph of relations

Towards everlasting privacy and efficient coercion resistance in remote electronic voting

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter (peer-reviewed)peer-review

Published
  • P. Grontas
  • A. Pagourtzis
  • A. Zacharakis
  • B. Zhang
Close
Publication date2019
Host publicationFC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security
EditorsAndrea Bracciali, Federico Pintore, Jeremy Clark, Ittay Eyal, Aviv Zohar, Vanessa Teague, Massimiliano Sala
Place of PublicationCham
PublisherSpringer Verlag
Pages210-231
Number of pages22
ISBN (electronic)9783662588208
ISBN (print)9783662588192
<mark>Original language</mark>English

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10958 LNCS
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

In this work, we propose a first version of an e-voting scheme that achieves end-to-end verifiability, everlasting privacy and efficient coercion resistance in the JCJ setting. Everlasting privacy is achieved assuming an anonymous channel, without resorting to dedicated channels between the election authorities to exchange private data. In addition, the proposed scheme achieves coercion resistance under standard JCJ assumptions. As a core building block of our scheme, we also propose a new primitive called publicly auditable conditional blind signature (PACBS), where a client receives a token from the signing server after interaction; the token is a valid signature only if a certain condition holds and the validity of the signature can only be checked by a designated verifier. We utilize this primitive to blindly mark votes under coercion in an auditable manner.