Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/220321
COMPARTIR / EXPORTAR:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Invitar a revisión por pares abierta
Título

NetVote: A Strict-Coercion Resistance Re-Voting Based Internet Voting Scheme with Linear Filtering

AutorQuerejeta-Azurmendi, Iñigo; Arroyo Guardeño, David CSIC ORCID ; Hernández-Ardieta, Jorge L.; Hernández Encinas, Luis CSIC ORCID
Palabras claveInternet voting
Coercion-resistance
Data privacy
Zero knowledge
Homomorphic encryption
Usability
Fecha de publicación2020
EditorMultidisciplinary Digital Publishing Institute
CitaciónMathematics 8(9): 1618 (2020)
ResumenThis paper proposes NetVote, an internet voting protocol where usability and ease in deployment are a priority. We introduce the notion of strict coercion resistance, to distinguish between vote-buying and coercion resistance. We propose a protocol with ballot secrecy, practical everlasting privacy, verifiability and strict coercion resistance in the re-voting setting. Coercion is mitigated via a random dummy vote padding strategy to hide voting patterns and make re-voting deniable. This allows us to build a filtering phase with linear complexity, based on zero knowledge proofs to ensure correctness while maintaining privacy of the process. Voting tokens are formed by anonymous credentials and pseudorandom identifiers, achieving practical everlasting privacy, where even if dealing with a future computationally unbounded adversary, vote intention is still hidden. It is not assumed for voters to own cryptographic keys prior to the election, nor store cryptographic material during the election. This property allows voters not only to vote multiple times, but also from different devices each time, granting the voter a vote-from-anywhere experience. This paper builds on top of the paper published in CISIS’19. In this version, we modify the filtering. Moreover, we formally define the padding technique, which allows us to perform the linear filtering scheme. Similarly we provide more details on the protocol itself and include a section of the security analysis, where we include the formal definitions of strict coercion resistance and a game based definition of practical everlasting privacy. Finally, we prove that NetVote satisfies them all.
Descripción© 2020 by the authors.
Versión del editorhttps://doi.org/10.3390/math8091618
URIhttp://hdl.handle.net/10261/220321
DOI10.3390/math8091618
E-ISSN2227-7390
Aparece en las colecciones: (ITEFI) Artículos




Ficheros en este ítem:
Fichero Descripción Tamaño Formato
NetVote_Querejeta_Art2020.pdf521,82 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo

CORE Recommender

SCOPUSTM   
Citations

4
checked on 25-mar-2024

WEB OF SCIENCETM
Citations

3
checked on 27-feb-2024

Page view(s)

132
checked on 28-mar-2024

Download(s)

165
checked on 28-mar-2024

Google ScholarTM

Check

Altmetric

Altmetric


Este item está licenciado bajo una Licencia Creative Commons Creative Commons