Analysis of Electronic Voting Protocol Using Strand Space Model

In this paper, we studied the electronic voting protocol to formalize and verify its fairness, privacy type properties in the strand space model. Also we established a suitable attacker model, the concept of pair bundles and equivalence of pair bundles which are used to frame the formalization and verification of fairness, privacy type properties in detail using the strand space model. For example, FOO protocol is considered to illustrate the model developed using the strand space theory. The result shows that the fairness, vote privacy properties are satisfied and receipt freeness property is failed for FOO protocol. Finally, an improvement of the FOO protocol is proposed so that it achieves receipt freeness property.

[1]  Markus Jakobsson,et al.  Towards Trustworthy Elections, New Directions in Electronic Voting , 2010, Towards Trustworthy Elections.

[2]  Panayiotis Kotzanikolaou,et al.  Using Strand Space Model to Verify the Privacy Properties of a Fair Anonymous Authentication Scheme , 2012, 2012 16th Panhellenic Conference on Informatics.

[3]  Wolter Pieters,et al.  Receipt-freeness as a special case of anonymity in epistemic logic , 2006 .

[4]  F. Javier Thayer Fábrega,et al.  Strand spaces: proving security protocols correct , 1999 .

[5]  Yichun Liu,et al.  Fairness analysis of e-commerce protocols based on strand spaces , 2013, Int. J. Grid Util. Comput..

[6]  Ramaswamy Ramanujam,et al.  Knowledge-based modelling of voting protocols , 2007, TARK '07.

[7]  Lu Zhang,et al.  Formal analysis of anonymity based on strand space model , 2008, 2008 First IEEE International Conference on Ubi-Media Computing.

[8]  Michael Backes,et al.  Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[9]  Mark Ryan,et al.  Analysis of an Electronic Voting Protocol in the Applied Pi Calculus , 2005, ESOP.

[10]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[11]  Mark Ryan,et al.  Coercion-resistance and receipt-freeness in electronic voting , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[12]  Kazue Sako,et al.  Efficient Receipt-Free Voting Based on Homomorphic Encryption , 2000, EUROCRYPT.

[13]  Kazue Sako.  Electronic Voting Schemes , 2005, Encyclopedia of Cryptography and Security.

[14]  Mark Ryan,et al.  Verifying privacy-type properties of electronic voting protocols , 2009, J. Comput. Secur..

[15]  Jennifer Seberry,et al.  Advances in Cryptology — AUSCRYPT '92 , 1992, Lecture Notes in Computer Science.

[16]  David Pointcheval,et al.  On Some Incompatible Properties of Voting Schemes , 2010, Towards Trustworthy Elections.