Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.916
This paper presents a voting scheme that coalesces many of the advantageous features of an efficient e-voting scheme like receipt-freeness, uncoercibility and write-in ballot, without requiring untappable channels. Some of the previous schemes in the literature provide most of these features with a penalty of increased running time. The proposed scheme utilizes the advantages of a novel data structure known as “ hierarchical binary search tree” for reducing the running time in linear order and also satisfies the desirable features of the existing write-in and coercion resistant voting schemes, such as fair degree of efficiency and protection against any kind of adversarial behavior with lowest running time. The proposed scheme is applicable to any kind of real time elections.
e voting, coercion resistance, write-in ballot, receipt-freeness, hierarchical binary search tree
Vinodu George, M.P. Sebastian, "An Efficient Homomorphic Coercion Resistant Voting Scheme Using Hierarchical Binary Search Tree", CSIE, 2009, Computer Science and Information Engineering, World Congress on, Computer Science and Information Engineering, World Congress on 2009, pp. 502-507, doi:10.1109/CSIE.2009.916