Internet voting protocol based on implicit data security
Abhishek Parakh, Subhash Kak

TL;DR
This paper introduces an Internet voting protocol that enhances security through vote partitioning across multiple servers, allowing vote recasting and supporting applications like bargaining and e-commerce.
Contribution
It proposes a novel implicit data security protocol enabling vote recasting and distributed storage, improving flexibility and security in online voting systems.
Findings
Votes are securely divided and stored across multiple servers.
Voters can change their votes during the polling period.
The protocol supports applications in bargaining and electronic commerce.
Abstract
This paper presents a new protocol for Internet voting based on implicit data security. This protocol allows recasting of votes, which permits a change of mind by voters either during the time window over which polling is open or during a shorter period over which recasting is permitted. The security of votes depends on multiple servers such that each vote is divided into partitions and these partitions are distributed among the servers, all of which need to be brought together to reconstruct the votes. Such a protocol has potential applications in bargaining and electronic commerce.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInternet Traffic Analysis and Secure E-voting · Access Control and Trust · Network Security and Intrusion Detection
