Logo des Repositoriums

Auflistung nach Schlagwort "Coercion-Resistance"

1 - 2 von 2
  • Textdokument
    Coercion-resistant i-voting with short PIN and OAuth 2.0
    (E-Vote-ID 2023, 2023) Bitussi, M.; Longo, R.; Marino, F. Antonio; Morelli, U.; Sharif, A.; Spadafora, C.; Tomasi, A.
    This paper presents an architecture for an OAuth 2.0-based i-voting solution using a mobile native client in a variant of the Araújo-Traoré protocol. We follow a systematic approach by identifying relevant OAuth 2.0 specifications and best practices. Having defined our framework, we identify threats applicable to our proposed methodology and detail how our design mitigates them to provide a safer i-voting process.
  • 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.