Handbook of Truly Concurrent Process Algebra

Chapter 31: Analyses of secure elections protocols

Abstract

This chapter introduces the modeling of secure election protocols based on truly concurrent process algebra.

Keywords

Secure Election Protocols; Process Algebra; True Concurrency

Secure elections protocols should be able to prevent cheating and maintain the voter's privacy. An ideal secure election protocol should have the following properties:

1. 1.  Legitimacy: only authorized voters can vote;
2. 2.  Oneness: no one can vote more than once;
3. 3.  Privacy: no one can determine for whom anyone else voted;
4. 4.  Non-replicability: no one can duplicate anyone else's vote;
5. 5.  Non-changeability: no one can change anyone else's vote;
6. 6.  Validness: every voter can make sure that his vote has been taken into ...