Paper 2018/215

Towards everlasting privacy and efficient coercion resistance in remote electronic voting

Panagiotis Grontas, Aris Pagourtzis, Alexandros Zacharakis, and Bingsheng Zhang


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

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. MINOR revision.3rd Workshop on Advances in Secure Electronic Voting
electronic votingend-to-end verifiabilitycoercion resistanceeverlasting privacy
Contact author(s)
pgrontas @ gmail com
2018-02-26: received
Short URL
Creative Commons Attribution


      author = {Panagiotis Grontas and Aris Pagourtzis and Alexandros Zacharakis and Bingsheng Zhang},
      title = {Towards everlasting privacy and efficient coercion resistance in remote electronic voting},
      howpublished = {Cryptology ePrint Archive, Paper 2018/215},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.