The coercion issue in remote electronic voting has always been of particular interest. However, to date, all proposals addressing it either suffer from some shortcomings or are not efficient enough to be used in real world elections. To fill this gap, we propose a new coercionresistant electronic voting scheme practical for real polls. Our scheme relies on credentials generated thanks to a recent algebraic Message Authentication Code (MAC) scheme due to Chase et al. To enable multiple elections and credentials revocation, we also design a novel sequential aggregate MAC scheme, that is of independent interest. Thanks to it, eligible voters’ credentials can be efficiently updated.
CITATION STYLE
Araújo, R., Barki, A., Brunet, S., & Traoré, J. (2016). Remote electronic voting can be efficient, verifiable and coercion-resistant. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9604 LNCS, pp. 224–232). Springer Verlag. https://doi.org/10.1007/978-3-662-53357-4_15
Mendeley helps you to discover research relevant for your work.