{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:59:34Z","timestamp":1781107174726,"version":"3.54.1"},"reference-count":38,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,1]]},"abstract":"<p>Electronic voting has found wider acceptance both in developed and developing countries in the recent past. The current research focuses mainly in the area of privacy and security aspects of e-voting. In spite of the good security and privacy features, the existing e-voting protocols remain useful only to small elections or just to support the conventional voting, mainly because of their high computational overhead. Naturally, e-voting is not in wide use, even in the developed countries. Thus, there is a need for e-voting protocols which are secure and practical, but with less complexity. This paper proposes an efficient protocol and framework for the practical implementation of the electronic election process. An analysis on the largest election process in the world shows that the proposed protocol has the potential to serve as an efficient polling system with increased voter turnout. This protocol can be adopted easily in the developed world too.<\/p>","DOI":"10.4018\/ijegr.2013100105","type":"journal-article","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:45:13Z","timestamp":1395395113000},"page":"75-91","source":"Crossref","is-referenced-by-count":0,"title":["A Secure and Efficient Scheme for Remote Poll Station Voting"],"prefix":"10.4018","volume":"9","author":[{"given":"Vinodu","family":"George","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, National Institute of Technology, Calicut, Kerala, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. P.","family":"Sebastian","sequence":"additional","affiliation":[{"name":"Information Technology and Systems Area, Indian Institute of Management, Kozhikode, Kerala, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijegr.2013100105-0","unstructured":"ACE project. (2012). Retrieved June 15, 2012, from http:\/\/aceproject.org\/ace-en\/focus\/e-voting\/countries"},{"key":"ijegr.2013100105-1","unstructured":"Acquisti, A. (2004). Receipt-free homomorphic elections and write-in ballots. Cryptology ePrint Archive, IACR. Retrieved October 30, 2010, from http:\/\/eprint.iacr.org\/"},{"key":"ijegr.2013100105-2","doi-asserted-by":"crossref","unstructured":"Adida, B., & Rivest, R. (2006). Scratch & vote: Self-contained paper-based cryptographic voting. In Proceedings of the 5th ACM Workshop on Privacy in Electronic Society (WPES \u201906), New York, NY (pp. 29\u201340).","DOI":"10.1145\/1179601.1179607"},{"key":"ijegr.2013100105-3","unstructured":"Araujo, R. (2008). On remote and voter-verifiable Voting. Doctoral dissertation, Department of Computer Science, Darmstadt University of Technology, Germany."},{"key":"ijegr.2013100105-4","doi-asserted-by":"crossref","unstructured":"Araujo, R. N., Ben Rajeb, R., Traore, J., & Youss, S. (2010). Towards practical and secure coercion-resistant electronic elections. In Proceedings of the 9th International Conference on Cryptology And Network Security (ANS'10), Kuala Lumpur, Malaysia (pp. 278-297). LNCS 6467.","DOI":"10.1007\/978-3-642-17619-7_20"},{"key":"ijegr.2013100105-5","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P., Pointcheval, D. G., & Poupard, J. (2001). Practical multi-candidate election system. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC '01) (pp. 274-283). ACM Press.","DOI":"10.1145\/383962.384044"},{"key":"ijegr.2013100105-6","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Moran, T., Naish, L., Ramchen, K., & Teague, V. (2009). Shuffle-sum: Coercion-resistant verifiable tallying for stv voting. Transactions on Information Forensic Security, 685-698.","DOI":"10.1109\/TIFS.2009.2033757"},{"key":"ijegr.2013100105-7","doi-asserted-by":"crossref","unstructured":"Benaloh, J., & Tuinstra, D. (1994). Receipt-free secret-ballot elections. In Proceedings of the 26th Annual Symposium on Theory of Computing (STOC\u201994) (pp. 544\u2013553). ACM Press.","DOI":"10.1145\/195058.195407"},{"key":"ijegr.2013100105-8","unstructured":"Bentley, J., & Sedgewick, R. (1997). Fast algorithms for sorting and searching strings. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics (pp. 360\u2013369). ACM Press."},{"key":"ijegr.2013100105-9","unstructured":"Carback, R. T. (2010). Engineering practical end-to-end verifiable voting systems. Doctoral dissertation, University of Maryland."},{"key":"ijegr.2013100105-10","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"ijegr.2013100105-11","unstructured":"Chaum, D. (2002). Secret-ballot receipts and transparent integrity. Retrieved March 25, 2006, from http:\/\/vreceipt.com\/article.pdf"},{"key":"ijegr.2013100105-12","doi-asserted-by":"crossref","unstructured":"Chaum, D., Essex, A., Carback, R., Clark, J., Popoveniuc, S., Sherman, A. T., et al. (2008, May\/June). Scantegrity: End-to-end voter verifiable optical-scan voting. IEEE Security and Privacy.","DOI":"10.1109\/MSP.2008.70"},{"key":"ijegr.2013100105-13","doi-asserted-by":"crossref","unstructured":"Chaum, D. C. (2010). Scantegrity II: End-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Transactions on Information Forensics and Security: Special Issue on Electronic Voting, 611\u2013627.","DOI":"10.1109\/TIFS.2009.2034919"},{"key":"ijegr.2013100105-14","first-page":"174","article-title":"Proofs of partial knowledge and simplified design of witness hiding protocols.","volume":"52","author":"R.Cramer","year":"1997","journal-title":"Desmedt"},{"key":"ijegr.2013100105-15","unstructured":"DeMillo, R., Lynch, N., & Merritt, M. C. (1984). Cryptographic protocols. In Proceedings of the 14th ACM Symposium on Theory of Computing (pp. 383-400). ACM Press."},{"key":"ijegr.2013100105-16","unstructured":"Election Commission of India. (2009). 2009 Lok Sabha election. Retrieved June 13, 2010, from http:\/\/eci.nic.in\/eci_main\/index.asp"},{"key":"ijegr.2013100105-17","doi-asserted-by":"crossref","unstructured":"George, V., & Sebastian, M. P. (2009). An efficient homomorphic coercion resistant voting scheme using hierarchical binary search tree. In Proceedings of the World Congress on Computer Science and Information Engineering (CSIE 09). IEEE Computer Society.","DOI":"10.1109\/CSIE.2009.916"},{"key":"ijegr.2013100105-18","doi-asserted-by":"crossref","unstructured":"Juels, A., Catalano, D., & Jakobsson, M. (2005). Coercion resistant electronic elections. In Proceedings of the 4th ACM Workshop on Privacy in Electronic Society (WPES\u201905) (pp. 61-70). ACM Press.","DOI":"10.1145\/1102199.1102213"},{"key":"ijegr.2013100105-19","doi-asserted-by":"crossref","unstructured":"Kiayias, A., & Young, M. (2004). The vector-ballot e-voting approach. Financial cryptography, Vol. 3110, LNCS. Springer-Verlag.","DOI":"10.1007\/978-3-540-27809-2_9"},{"key":"ijegr.2013100105-20","doi-asserted-by":"crossref","unstructured":"Kiayias, A., & Yung, M. (2002). Self-tallying elections and perfect ballot secrecy. In Proceedings of the PKC \u201902, Vol. 2274, LNCS (pp. 141\u2013158). Springer-Verlag.","DOI":"10.1007\/3-540-45664-3_10"},{"key":"ijegr.2013100105-21","doi-asserted-by":"crossref","unstructured":"Kusters, R., Truderung, T., & Vogt, A. (2010). A game-based definition of coercion-resistance and its applications. In Proceedings of the 23rd IEEE Computer Security Foundations Symposium (pp. 122-136). IEEE Computer Society.","DOI":"10.1109\/CSF.2010.16"},{"key":"ijegr.2013100105-22","first-page":"245","article-title":"Providing receipt freeness in mixnet- based voting protocols.","volume":"03","author":"B.Lee","year":"2003","journal-title":"Proceedings of the ICISC"},{"key":"ijegr.2013100105-23","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2002.1038569"},{"key":"ijegr.2013100105-24","unstructured":"National Informatics Centre. (2010). Retrieved July 14, 2010, from NIC: http:\/\/home.nic.in\/"},{"key":"ijegr.2013100105-25","doi-asserted-by":"crossref","unstructured":"Neff, A. (2001). A verifiable secret shuffle and its application to e-voting. In Proceedingso f the 8th ACM conference on Computer and Communications Security (pp. 116\u2013125). ACM Press.","DOI":"10.1145\/501983.502000"},{"key":"ijegr.2013100105-26","unstructured":"Neff, A. (2003). Detecting malicious poll site voting clients. Retrieved June 5, 2008, from http:\/\/www.votehere.net\/"},{"key":"ijegr.2013100105-27","doi-asserted-by":"crossref","unstructured":"Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the EUROCRYPT (pp. 223\u2013238).","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ijegr.2013100105-28","unstructured":"Popoveniuc, S. (2009). A framework for secure mixnet-based electronic voting. Doctoral dissertation, George Washington University."},{"key":"ijegr.2013100105-29","unstructured":"Popoveniuc, S., & Hosp, B. (2006). An introduction to punchscan. In Proceedings of the Workshop on Trustworthy Elections (WOTE)."},{"key":"ijegr.2013100105-30","unstructured":"Prasad, H. K., Halderman, J. A., Gonggrijp, R., Wolchok, S., Wustrow, E., Kankipati, A., et al. (2010). Security analysis of India\u2019s electronic voting machines. In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS). ACM Press."},{"key":"ijegr.2013100105-31","unstructured":"Rivest, R. (2006). The three ballot voting system. Retrieved October 10, 2010, from http:\/\/theory.lcs.mit.edu\/~rivest\/Rivest-TheThreeBallotVotingSystem.pdf"},{"key":"ijegr.2013100105-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2005.11.003"},{"key":"ijegr.2013100105-33","doi-asserted-by":"crossref","unstructured":"Spycher, O., Koenig, R., Haenni, R., & Schlapfer, M. (2012). A new approach towards coercion-resistant remote e-voting in linear time. In Proceedings of the 15th International Conference on Financial Cryptography (LNCS- 7035, pp. 182-189). Springr Verlag.","DOI":"10.1007\/978-3-642-27576-0_15"},{"key":"ijegr.2013100105-34","unstructured":"Spycher, O., Koenig, R., Haenni, R., & Schlapfer, M. (2012). Achieving meaningful efficiency in coercion-resistant, verifiable internet voting. In Proceedings of the 5th International Workshop on Electronic Voting (EVOTE'12) (pp. 113-126). Bregenz, Austria: P-205 in Lecture Notes in Informatics."},{"key":"ijegr.2013100105-35","doi-asserted-by":"crossref","unstructured":"Weber, G., Araujo, R., & Buchmann, J. (2007). On coercion-resistant electronic elections with linear work. In Proceedings of the 2nd International Conference on Availability, Reliability and Security (ARES'07), Vienna, Austria (pp. 908-916).","DOI":"10.1109\/ARES.2007.108"},{"key":"ijegr.2013100105-36","author":"S.Weber","year":"2008","journal-title":"Coercion-resistant cryptographic voting: Implementing free and secret electronic elections"},{"key":"ijegr.2013100105-37","doi-asserted-by":"crossref","unstructured":"Yao, A. (1982). Protocols for secure computations. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (pp. 160-164). Chicago, IL: IEEE Computer Society.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["International Journal of Electronic Government Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=103894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:19:35Z","timestamp":1654082375000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijegr.2013100105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijegr.2013100105","relation":{},"ISSN":["1548-3886","1548-3894"],"issn-type":[{"value":"1548-3886","type":"print"},{"value":"1548-3894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}