This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
An Efficient Homomorphic Coercion Resistant Voting Scheme Using Hierarchical Binary Search Tree
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Index Terms:
e voting, coercion resistance, write-in ballot, receipt-freeness, hierarchical binary search tree
Citation:
Vinodu George, M.P. Sebastian, "An Efficient Homomorphic Coercion Resistant Voting Scheme Using Hierarchical Binary Search Tree," csie, vol. 1, pp.502-507, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.