Description
Internet voting offers a better voting experience since voters can cast their votes from their computers or even smartphones. By eliminating the need to visit polling places, it may attract more voters and thus increase voter turnout. However, it is still not widely spread owing to many inherent concerns such as risks entailed by the lack of private polling booths. Indeed, this may ease coercion and vote-buying attacks. Consequently, electronic voting schemes ought to address this issue that remained a challenge for many years. In this talk, we will present a practical approach for constructing coercion-resistant and ‘end-to-end verifiable’ electronic voting protocols suitable for real elections. Our construction relies on voting credentials generated thanks to a recent algebraic Message Authentication Code (MAC) scheme due to Chase et al. To enable multiple elections and credentials revocation, we will also introduce a novel sequential aggregate MAC scheme. We will conclude our presentation with a discussion of ongoing research in the area of remote voting.
Next sessions
-
Dual attacks in code-based (and lattice-based) cryptography
Speaker : Charles Meyer-Hilfiger - Inria Rennes
The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]-
Cryptography
-
-
Lie algebras and the security of cryptosystems based on classical varieties in disguise
Speaker : Mingjie Chen - KU Leuven
In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups. In this talk, we[…]-
Cryptography
-