A generic ABRTY based coercion-resistant voting scheme

29.01.2015, 11:00 – 12:00

2015/01/29 11:00-12:00

Speaker: Dr. Roberto Araújo | Location: Hochschulstraße 10, Piloty Building (S2|02), Room B002, Darmstadt

Organizer: Prof. Johannes Buchmann / Prof. Melanie Volkamer


Estonia was the first country in the world to conduct general elections over the internet. This may motivate others countries to introduce internet voting due mainly to its benefits. Internet voting is more attractive for voters as they may vote from any place with internet access. Also, it may reduce costs and increase voter turnout. However, the risks increases as we remove the voting booth. Coercer and vote sellers, for instance, can easily succeed as voters can use any computer to vote. In 2006, Juels, Catalano, and Jakobsson (JCJ) introduced a voting scheme that considers realistic attacks in the internet voting scenario.

Unfortunately, JCJ scheme is not efficient for large scale elections. Based on JCJ solution, more efficient schemes were proposed. Nowadays, the most efficient scheme was introduced by ABRTY. This scheme, though, depends on two computational hard problems and cannot be based on other problems. In this talk, I first recall the idea behind JCJ and ABRTY proposals. After that, I introduce a generic version of ABRTY voting scheme.