Standard
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. / Grontas, P.; Pagourtzis, A.; Zacharakis, A. et al.
FC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security. ed. / Andrea Bracciali; Federico Pintore; Jeremy Clark; Ittay Eyal; Aviv Zohar; Vanessa Teague; Massimiliano Sala. Cham: Springer Verlag, 2019. p. 210-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10958 LNCS).
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
Harvard
Grontas, P, Pagourtzis, A, Zacharakis, A
& Zhang, B 2019,
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. in A Bracciali, F Pintore, J Clark, I Eyal, A Zohar, V Teague & M Sala (eds),
FC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10958 LNCS, Springer Verlag, Cham, pp. 210-231.
https://doi.org/10.1007/978-3-662-58820-8_15APA
Grontas, P., Pagourtzis, A., Zacharakis, A.
, & Zhang, B. (2019).
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. In A. Bracciali, F. Pintore, J. Clark, I. Eyal, A. Zohar, V. Teague, & M. Sala (Eds.),
FC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security (pp. 210-231). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10958 LNCS). Springer Verlag.
https://doi.org/10.1007/978-3-662-58820-8_15Vancouver
Grontas P, Pagourtzis A, Zacharakis A
, Zhang B.
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. In Bracciali A, Pintore F, Clark J, Eyal I, Zohar A, Teague V, Sala M, editors, FC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security. Cham: Springer Verlag. 2019. p. 210-231. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2019 Feb 10. doi: 10.1007/978-3-662-58820-8_15
Author
Grontas, P. ; Pagourtzis, A. ; Zacharakis, A. et al. /
Towards everlasting privacy and efficient coercion resistance in remote electronic voting. FC 2018 International Workshops, VOTING 18: International Conference on Financial Cryptography and Data Security. editor / Andrea Bracciali ; Federico Pintore ; Jeremy Clark ; Ittay Eyal ; Aviv Zohar ; Vanessa Teague ; Massimiliano Sala. Cham : Springer Verlag, 2019. pp. 210-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bibtex
@inbook{57457d1239144675b219cfe88792865b,
title = "Towards everlasting privacy and efficient coercion resistance in remote electronic voting",
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.",
keywords = "Coercion resistance, Electronic voting, End-to-end verifiability, Everlasting privacy, Publicly auditable conditional blind signatures",
author = "P. Grontas and A. Pagourtzis and A. Zacharakis and B. Zhang",
year = "2019",
doi = "10.1007/978-3-662-58820-8_15",
language = "English",
isbn = "9783662588192 ",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "210--231",
editor = "Andrea Bracciali and Federico Pintore and Jeremy Clark and Ittay Eyal and Aviv Zohar and Vanessa Teague and Massimiliano Sala",
booktitle = "FC 2018 International Workshops, VOTING 18",
address = "Germany",
}
RIS
TY - CHAP
T1 - Towards everlasting privacy and efficient coercion resistance in remote electronic voting
AU - Grontas, P.
AU - Pagourtzis, A.
AU - Zacharakis, A.
AU - Zhang, B.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
KW - Coercion resistance
KW - Electronic voting
KW - End-to-end verifiability
KW - Everlasting privacy
KW - Publicly auditable conditional blind signatures
U2 - 10.1007/978-3-662-58820-8_15
DO - 10.1007/978-3-662-58820-8_15
M3 - Chapter (peer-reviewed)
SN - 9783662588192
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 210
EP - 231
BT - FC 2018 International Workshops, VOTING 18
A2 - Bracciali, Andrea
A2 - Pintore, Federico
A2 - Clark, Jeremy
A2 - Eyal, Ittay
A2 - Zohar, Aviv
A2 - Teague, Vanessa
A2 - Sala, Massimiliano
PB - Springer Verlag
CY - Cham
ER -
