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
|
Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra, Eric Simancas-Acevedo.
© 2026.
26 pages.
|
|
Ricardo A. Barrera-Cámara, David H. Fuque-Ehuan, Alejandro Fuentes-Penna.
© 2026.
36 pages.
|
|
Juan Manuel Xicoténcatl-Pérez, Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra, José M. Liceaga-Ortiz-De-La-Peña, Julio César Ramos-Fernández, Rubén Oswaldo Hernández-Terrazas.
© 2026.
28 pages.
|
|
Francisco R. Trejo-Macotela, Jaime Aguilar-Ortiz, Esther Citlali Garcia-Contreras.
© 2026.
48 pages.
|
|
Francisco R. Trejo-Macotela, Uriel Amado Ramírez-Hernández, Daniel Robles-Camarillo, Edgar López-López.
© 2026.
40 pages.
|
|
Francisco R. Trejo-Macotela.
© 2026.
46 pages.
|
|
Mario Oscar Ordaz Oliver, Evelin Gutiérrez, Jesús Patricio Ordaz, Javier Hernández Pérez, Amadeo Manuel Hernández Hernández, Justo Fabián Montiel Hernández.
© 2026.
24 pages.
|
|
|