Anonymity and CSP for Voting Systems

Abstract—In this paper we review a wide range of existing definitions for anonymity defined in different formal languages from the literature. Moreover, we discuss anonymity definitions for voting systems and model the specifications using Commu-nicating Sequential Processes (CSP). In addition, we formalise conventional voting system with CSP and analyse whether our voting system design satisfies the anonymity requirement with two different definitions, strong and weak anonymity. Further-more, we highlight the difference between strong and weak anonymity definitions regarding voting systems with a case study on conventional voting system. Finally, we conclude with the results taken from our model analysis, which expresses that the strong anonymity definition is too strong and the weak anonymity is more suitable specification for the voting processes