Show simple item record

dc.contributor.authorPuiggalí Allepuz, Jordi
dc.contributor.authorGuasch Castelló, Sandra
dc.contributor.editorKrimmer, Robert
dc.contributor.editorGrimm, Rüdiger
dc.date.accessioned2019-01-17T10:25:05Z
dc.date.available2019-01-17T10:25:05Z
dc.date.issued2010
dc.identifier.isbn978-3-88579-261-1
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/19496
dc.description.abstractImplementing a transparent audit process when an election is conducted by electronic means is of paramount importance. Universally verifiable mixnets are focused on providing such a property by means of cryptographic proofs verifiable by any auditor. While some of these systems require high amount of computing resources that make them inefficient for real elections, others proposals reduce the computation cost by sacrificing audit accuracy or reducing the voter privacy protection level. In this paper, we propose an efficient mixnet verification system that combines the advantages of the RPC and Optimistic Mixing techniques, achieving a high audit accuracy level while fully preserving voters' privacy.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartof4th International Conference on Electronic Voting 2010
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-167
dc.titleUniversally verifiable efficient re-encryption mixneten
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages241-254
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBregenz, Austria
mci.conference.dateJuly 21st-24th, 2010


Files in this item

Thumbnail

Show simple item record