Towards Automatic Analysis of Election Verifiability Properties
- Cite this paper as:
- Smyth B., Ryan M., Kremer S., Kourjieh M. (2010) Towards Automatic Analysis of Election Verifiability Properties. In: Armando A., Lowe G. (eds) Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security. ARSPA-WITS 2010. Lecture Notes in Computer Science, vol 6186. Springer, Berlin, Heidelberg
We present a symbolic definition that captures some cases of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the software tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifiability. We demonstrate the applicability of our formalism by analysing the protocols due to Fujioka, Okamoto & Ohta and a variant of the one by Juels, Catalano & Jakobsson (implemented as Civitas by Clarkson, Chong & Myers).
KeywordsElectronic voting protocols election verifiability applied pi calculus ProVerif automated reasoning
Unable to display preview. Download preview PDF.