Show simple item record

dc.contributor.authorPopoveniuc, Stefan
dc.contributor.authorRegenscheid, Andrew
dc.contributor.editorKrimmer, Robert
dc.contributor.editorGrimm, Rüdiger
dc.date.accessioned2019-01-17T10:25:04Z
dc.date.available2019-01-17T10:25:04Z
dc.date.issued2010
dc.identifier.isbn978-3-88579-261-1
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/19492
dc.description.abstractWe present Sigma ballots, a new type of ballot designed to be used in secure elections. Sigma ballots use the random order of candidates introduced by Prêt à Voter, combined with the confirmation codes of Scantegrity II. These ballots can be produced by a DRE machine with a slightly modified VVPAT, or can be similar to optical scan ballots. Sigma ballots work in conjunction with existing publicly verifiable tallying schemes to allow for end-to-end verifiability. The advantages of Sigma ballots include an easy check for correct printing, the possibility of keeping a fixed order of candidates when selections are made, automated creation of receipts, no extra marks added to the ballot after it is cast, the ability to be hand counted, and voters only needing to know a valid confirmation code to file a complaint.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.titleSigma ballotsen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages179-190
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBregenz, Austria
mci.conference.dateJuly 21st-24th, 2010


Files in this item

Thumbnail

Show simple item record