2009 WRI World Congress on Computer Science and Information Engineering 2009
DOI: 10.1109/csie.2009.916
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Homomorphic Coercion Resistant Voting Scheme Using Hierarchical Binary Search Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
0
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 18 publications
0
0
0
Order By: Relevance
“…A generic e-voting system or I-voting system consists of the following sets of entities (George & Sebastian, 2009). Figure 1 shows the organization of the various entities in a voting system:…”
Section: The Voting Modelmentioning
confidence: 99%
See 3 more Smart Citations
“…A generic e-voting system or I-voting system consists of the following sets of entities (George & Sebastian, 2009). Figure 1 shows the organization of the various entities in a voting system:…”
Section: The Voting Modelmentioning
confidence: 99%
“…During the registration phase, each responsible authority creates the shares of the voting credential for each eligible voter. Each authority posts these credential shares on the Bulletin Board (BB), encrypted with both authority's and voter's public key (George & Sebastian, 2009). These shares will be sent to the intended voters (along with the proof) and also to the Validator (after proper encryption).…”
Section: The Voting Protocol and Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations