A formal framework for modelling coercion resistance and receipt freeness

Abstract

Abstract. Coercion resistance and receipt freeness are critical proper-ties for any voting system. However, many different definitions of these properties have been proposed, some formal and some informal; and there has been little attempt to tie these definitions together or identify rela-tions between them. We give here a general framework for specifying different coercion re-sistance and receipt freeness properties using the process algebra CSP. The framework is general enough to accommodate a wide range of defini-tions, and strong enough to cover both randomization attacks and forced abstention attacks. We provide models of some simple voting systems, and show how the framework can be used to analyze these models un-der different definitions of coercion resistance and receipt freeness. Our formalisation highlights the variation between the definitions, and the importance of understanding the relations between them.