Logo des Repositoriums

P347: E-Vote-ID 2023 - Eight International Joint Conference on Electronic Voting

https://dl.gi.de/handle/20.500.12116/45430
Auflistung nach:

Auflistung P347: E-Vote-ID 2023 - Eight International Joint Conference on Electronic Voting nach Autor:in "Aranha, Diego F."

1 - 2 von 2
  • Textdokument
    E-Vote-ID 2023: Eight International Joint Conference on Electronic Voting
    (E-Vote-ID 2023, 2023) Pointcheval, David; Haenni, Rolf; Kořánová, Ilona Starý; Aranha, Diego F.; Battagliola, Michele; Roy, Lawrence; Bitussi, M.; Longo, R.; Marino, F. Antonio; Morelli, U.; Sharif, A.; Spadafora, C.; Tomasi, A.; Erb, Yannick; Duenas-Cid, David; Volkamer, Melanie; Serrano Iova, Radu Antonio; Duenas-Cid, David; Loeber, Leontine; Martin-Rozumiłowicz, Beata; Macias, Ryan; Rodríguez-Pérez, Adrià; Costa, Núria; Finogina, Tamara; Esseiva, Olivier; Høgåsen, Audhild; Monnat, Xavier; Cortier, Véronique; Gaudry, Pierrick; Glondu, Stéphane; Ruhault, Sylvain; Hilt, Tobias; Sein, Kati; Mällo, Tanel; Willemson, Jan; Hilt, Tobias; Kulyk, Oksana; Glazer, Amanda K.; Spertus, Jacob V.; Stark, Philip B.; Spycher, Oliver; Barrat Esteve, Jordi
  • Textdokument
    Faster coercion-resistant e-voting by encrypted sorting
    (E-Vote-ID 2023, 2023) Aranha, Diego F.; Battagliola, Michele; Roy, Lawrence
    Coercion resistance is one of the most challenging security properties to achieve when designing an e-voting protocol. The JCJ voting scheme, proposed in 2005 by Juels, Catalano and Jakobsson, is one of the first voting systems where coercion-resistance was rigorously defined and achieved, making JCJ the benchmark for coercion-resistant protocols. Recently, the coercion-resistance definition proposed in JCJ has been disputed and improved by Cortier, Gaudry, and Yang. They identified a major problem, related to leakage of the number of discarded votes by revoting; and proposed CHide, a new protocol that solves the issue and satisfies a stronger security notion. In this work we present an improved version of CHide, with complexity O(n log(n)) instead of O(n^2) in the number n of received ballots, that relies on sorting encrypted ballots to make the tallying phase faster. The asymptotic complexity of our protocol is competitive with other state-of-the-art coercion-resistant voting protocols satisfying the stronger notion for coercion resistance.