Table of contents

  • This session has been presented December 11, 2009.

Description

  • Speaker

    Jacques Traoré - France telecom

We will focus on this talk on electronic voting which emulates traditional voting in a networked environment. We will first introduce the model of electronic voting. In particular, we will present the security requirements that an electronic voting system must fulfil in order to be a proper substitute for a paper-ballot system. We will also briefly review the cryptographic tools generally used to design secure electronic voting systems.<br/> We will then address some particular drawbacks of usual e-voting systems and show that recent works give serious hope to overcome them -or, on the contrary, annihilate such a hope. In particular, we will briefly present some methods which allow to detect when voting machines (or softwares) are misbehaving. By using them, it is possible to achieve the "What You See Is What You Vote for" property without performing a complex and costly security evaluation of these machines (or softwares). We will next briefly explain how to render useless all kind of coercive attacks (how to ensure that a vote is free, i.e. not constrained) in the context of on-line voting. Finally, we will also give evidence that the "perfect system" cannot exist, by mentioning some impossibility results from WOTE'06. In particular, perfect ballot secrecy and "universal" verifiability of the outcome of the election cannot be satisfied at the same time. We will conclude our presentation with a discussion of ongoing research on the area of e-voting protocols.

Next sessions

  • Schéma de signature à clé publique : Frobénius-UOV

    • May 29, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Gilles Macario-Rat - Orange

    L'exposé présente un schéma de signature à clé publique post-quantique inspiré du schéma UOV et introduisant un nouvel outil : les formes de Frobénius. L'accent est mis sur le rôle et les propriétés des formes de Frobénius dans ce nouveau schéma : la simplicité de description, la facilité de mise en oeuvre et le gain inédit sur les tailles de signature et de clé qui bat RSA-2048 au niveau de[…]
  • Yoyo tricks with a BEANIE

    • June 05, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Xavier Bonnetain - Inria

    TBD
    • Cryptography

    • Symmetrical primitive

Show previous sessions