Abstract
Electronic voting is a prime application of cryptographic tools. Many researches are addressing election or confidence voting in this area. We address a new type of voting scheme Divisible Voting Scheme, in which each voter has multiple ballots where the number of ballots can be different among the voters. This type of voting is popular. We first define the divisible voting scheme and show naive protocols based on existing voting schemes. Then we propose two efficient divisible voting schemes. The first scheme uses multisets, the second scheme uses L-adic representation of the number of ballots. The total cost for a voter is O(M 2 log(N)) in the first scheme and O(M log(N)) in the second scheme where M is the number of candidates to vote for and N is the number of ballots for a voter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
