[en] We present a new verifiable voting scheme based on the Hyperion scheme but providing everlasting privacy and receipt-freeness. As with Selene and Hyperion, it provides a direct form of E2E verifiability: voters verify the presence of their votes in plaintext in the tally. However, in contrast to Selene or Hyperion, the privacy of this protocol is everlasting. In addition, our protocol offers the novel feature of everlasting receipt-freeness and coercion mitigation.
Disciplines :
Computer science
Author, co-author :
MOSAHEB, Rafieh ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA
ROENNE, Peter ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA
RYAN, Peter Y A ; University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
Sarfaraz, Sara; University of Waterloo, Waterloo, Canada
External co-authors :
yes
Language :
English
Title :
Direct and Transparent Voter Verification with Everlasting Receipt-Freeness
Publication date :
2025
Event name :
E-VOTE-ID International Conference
Event place :
Tarragona, Esp
Event date :
02-10-2024 => 04-10-2024
Audience :
International
Main work title :
Electronic Voting - 9th International Joint Conference, E-Vote-ID 2024, Proceedings
Editor :
Duenas-Cid, David
Publisher :
Springer Science and Business Media Deutschland GmbH
Arapinis, M., Cortier, V., Kremer, S., Ryan, M.: Practical everlasting privacy. In: Basin, D., Mitchell, J.C. (eds.) Principles of Security and Trust, pp. 21–40. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013)
Bernhard, D., Cortier, V., Galindo, D., Pereira, O., Warinschi, B.: Sok: a comprehensive analysis of game-based ballot privacy definitions. In: Symposium on Security and Privacy, pp. 499–516. IEEE (2015)
Bernhard, D., Pereira, O., Warinschi, B.: How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios. In: Wang, X., Sako, K. (eds.) Advances in Cryptology – ASIACRYPT 2012, pp. 626–643. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34961-4 38
Cortier, V., Lallemand, J., Warinschi, B.: Fifty shades of ballot privacy: privacy against a malicious board. In: 33rd Computer Security Foundations Symposium (CSF), pp. 17–32. IEEE (2020)
Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multiauthority election scheme. Eur. Trans. Telecommun. 8(5), 481–490 (1997)
Cuvelier, É., Pereira, O., Peters, T.: Election verifiability or ballot privacy: do we need to choose? In: Crampton, J., Jajodia, S., Mayes, K. (eds.) Computer Security – ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings, pp. 481–498. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https://doi.org/10.1007/978-3-64240203-6 27
Damodaran, A., Rastikian, S., Rønne, P.B., Ryan, P.Y.A.: Hyperion: transparent end-to-end verifiable voting with coercion mitigation. Cryptology ePrint Archive, Paper 2024/1182 (2024)
Doan, T.V.T., Pereira, O., Peters, T.: Encryption mechanisms for receipt-free and perfectly private verifiable elections. In: Pöpper, C., Batina, L. (eds.) Applied Cryptography and Network Security: 22nd International Conference, ACNS 2024, Abu Dhabi, United Arab Emirates, March 5–8, 2024, Proceedings, Part I, pp. 257– 287. Springer Nature Switzerland, Cham (2024). https://doi.org/10.1007/978-3031-54770-6 11
Dragan, C.C., et al.: Machine-checked proofs of privacy against malicious boards for Selene and co. In: 35th Computer Security Foundations Symposium (CSF), pp. 335–347. IEEE (2022)
Fouque, P.-A., Pointcheval, D.: Threshold cryptosystems secure against chosenciphertext attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 351–368. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45682-1 21
Gjøsteen, K., Haines, T., Solberg, M.R.: Efficient mixing of arbitrary ballots with everlasting privacy: how to verifiably mix the PPATC scheme. In: Asplund, M., Nadjm-Tehrani, S. (eds.) Secure IT Systems: 25th Nordic Conference, NordSec 2020, Virtual Event, November 23–24, 2020, Proceedings, pp. 92–107. Springer International Publishing, Cham (2021). https://doi.org/10.1007/978-3-030-708528 6
Haines, T., Mueller, J., Mosaheb, R., Pryvalov, I.: Sok: secure e-voting with everlasting privacy. In: Proceedings on Privacy Enhancing Technologies (PoPETs) (2023)
Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 373–392. Springer, Heidelberg (2006). https://doi.org/10.1007/11818175 22
Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4, 161–174 (1991)