isrjournals
User Sign in    Editor Sign in

devising a private multi-event multi authority e-voting scheme using secret sharing

Ujan Mukhopadhyay,

Published in International Journal of Advanced Research in Computer Networking,Wireless and Mobile Communications

ISSN: 2320-7248          Impact Factor:1.8         Volume:2         Issue:3         Year: 08 April,2014         Pages:102-103

International Journal of Advanced Research in Computer Networking,Wireless and Mobile Communications

Abstract

When the world, as we know it, is getting more digitalized every day, the relevance of ballots and papers are getting considerably reduced. Even the whole concept of being physically present at the site is being antiquated. Voting for a motion, or election of a candidate, has entered the E-Domain. And hence has raised the questions of privacy of the voters. In this paper, we discuss a protocol where the voters can choose more than one event, and the calculation would reveal the total number of votes for each party/event, and the identity of the voters will be private. No one would be able to relate a voter with his vote. And we do so utilizing the concept of secret sharing. Here a vote cast by a voter is mapped into a binary string. I t is then broken into shares by the voter himself, all of which are required to determine the vote with certainty. We thus o er the voter with the full exibility of choosing as many numbers of events as he wishes, while keeping his identity secret

Kewords

E-Voting, Secret Sharing.

Reference

[1] Secret Sharing Schemes with Applications in Security Protocols (Ph.D. Thesis), Sorin Iftene, Universitatea Alexandru Ioan Cuza Iasi Facultatea de Informatic. [2] A. Shamir, How to share a secret. Communications of the ACM, 22(11):612613. [3] C. A. Asmuth and J. Bloom. A modular approach to key safeguarding. IEEE Transactions on Information Theory, IT-29(2):208210. [4] A. Beimel, T. Tassa, and E. Weinreb. Characterizing ideal weighted threshold secret sharing. In J. Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, volume 3378 of Lecture Notes in Computer Science, pages 600619. Springer-Verlag, 2005. [5] J. Benaloh. Veri able Secret-Ballot Elections. PhD thesis, Department of Computer Science, Yale University, September 1987. [6] C. Boyd. Digital multisignatures. In H. Beker and F. Piper, editors, Cryptography and Coding, 1986, pages 241246. Oxford University Press.