Lagrangian E-voting: Verifiability on demand and strong privacy

Abstract

We propose a new approach to verifiability of Internet e-voting procedures: correct counting of each single ballot can be checked, but verification is a zero-knowledge court procedure. After verification period is over, certain keys are destroyed and breaking vote privacy becomes substantially harder. Our main goal is to provide a framework for the political situation in which the voters are more concerned about disclosure of their preferences than about the correctness of the results. Our approach also responds to threats of coercion exercised by a physically present coercer. Our approach can be used on top of most previous schemes to improve their privacy features. It is limited to the cases when the voters hold electronic ID cards. © 2010 Springer-Verlag.