Welcome to the resource topic for 2023/837
Title:
Faster coercion-resistant e-voting by encrypted sorting
Authors: Diego F. Aranha, Michele Battagliola, Lawrence Roy
Abstract: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.
ePrint: https://eprint.iacr.org/2023/837
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .