Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: 21st IEEE Comp. Secur. Foundations Symposium, CSF 2008, pp. 195–209 (2008)
Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 62–71. ACM (2007)
Chevallier-Mames, B., Fouque, P.-A., Pointcheval, D., Stern, J., Traoré, J.: On some incompatible properties of voting schemes. In: Chaum, D., Jakobsson, M., Rivest, R.L., Ryan, P.Y.A., Benaloh, J., Kutylowski, M., Adida, B. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 191–199. Springer, Heidelberg (2010)
Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols. J. Comp. Secur. 17(4), 435–487 (2009)
Delaune, S., Kremer, S., Ryan, M.: Coercion-resistance and receipt-freeness in electronic voting. In: Proceedings of the 19th IEEE Comp. Secur. Foundations Workshop, pp. 28–39. IEEE Comp. Soc. Press (2006)
Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)
Fábrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving security protocols correct. J. Comp. Secur. 7(2), 191–230 (1999)
Jonker, H.L., Pieters, W.: Receipt-freeness as a special case of anonymity in epistemic logic. In: Proceedings of the IAVoSS Workshop on Trustworthy Elections (2006)
Liu, Y.: Fairness analysis of e-commerce protocols based on strand spaces. International Journal of Grid and Utility Computing 4(2), 128–133 (2013)
Petrakos, N., Kotzanikolaou, P., Douligeris, C.: Using Strand Space Model to Verify the Privacy Properties of a Fair Anonymous Authentication Scheme. In: 16th Panhellenic Conference on Informatics, pp. 105–110 (2012)
Zhang, L., Luo, J.: Formal analysis of anonymity based on strand space model. In: First IEEE International Conference on Ubi-Media Computing, pp. 75–81 (2008)
Zuzana, R.: Electronic Voting Schemes. Master’s thesis. Comenius University (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sureshkumar, V., Anitha, R. (2014). Analysis of Electronic Voting Protocol Using Strand Space Model. In: MartÃnez Pérez, G., Thampi, S.M., Ko, R., Shu, L. (eds) Recent Trends in Computer Networks and Distributed Systems Security. SNDS 2014. Communications in Computer and Information Science, vol 420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54525-2_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-54525-2_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54524-5
Online ISBN: 978-3-642-54525-2
eBook Packages: Computer ScienceComputer Science (R0)