Efficient Divisible Voting Scheme
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.1 pp.230-238
- Publication Date
- 2005/01/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.1.230
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Application
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Natsuki ISHIDA, Shin'ichiro MATSUO, Wakaha OGATA, "Efficient Divisible Voting Scheme" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 1, pp. 230-238, January 2005, doi: 10.1093/ietfec/e88-a.1.230.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.1.230/_p
Copy
@ARTICLE{e88-a_1_230,
author={Natsuki ISHIDA, Shin'ichiro MATSUO, Wakaha OGATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Divisible Voting Scheme},
year={2005},
volume={E88-A},
number={1},
pages={230-238},
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.},
keywords={},
doi={10.1093/ietfec/e88-a.1.230},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Efficient Divisible Voting Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 230
EP - 238
AU - Natsuki ISHIDA
AU - Shin'ichiro MATSUO
AU - Wakaha OGATA
PY - 2005
DO - 10.1093/ietfec/e88-a.1.230
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2005
AB - 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.
ER -
English
