The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Secure Multiparty/Multicandidate Electronic Elections
Abstract
In this chapter we present a methodology for proving in Zero Knowledge the validity of selecting a subset of a set belonging to predefined family of sets. We apply this methodology in electronic voting to provide for extended ballot options. Our proposed voting scheme supports multiple parties and the selection of a number of candidates from one and only one of these parties. We have implemented this system and provided measures of its computational and communication complexity. We show that the complexity is linear with respect to the total number of candidates and the number of parties participating in the election.
Related Content
|
Özge Önkan, Zeynep Arikan.
© 2022.
36 pages.
|
|
Arun Kumar G. Hiremath, Roopa G. M., Naveen Kumar K. R..
© 2022.
23 pages.
|
|
Mangesh Manikrao Ghonge, Sulakshana Mane, Devasis Pradhan.
© 2022.
25 pages.
|
|
Alaattin Parlakkılıç.
© 2022.
20 pages.
|
|
Syed Abbas.
© 2022.
22 pages.
|
|
Pinki Saini, Unaiza Iqbal, Mazia Ahmed, Devinder Kaur.
© 2022.
24 pages.
|
|
Subhodeep Mukherjee, Venkataiah Chittipaka, Manish Mohan Baral.
© 2022.
29 pages.
|
|
|