Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking
Name
WP_122_0.pdf
Size
518.74 KB
Format
Adobe PDF
Checksum (MD5)
fbfa38982bf314374c8bb265eb97933c
Author(s)
Rivest, Ronald L.
Rabin, Michael O.
Date Issued
April 3, 2014
Publisher
Caltech/MIT Voting Technology Project
Series/Report no.
VTP Working Paper Series;122
Abstract
We describe how to use Rabin's "split-value" representations, originally developed for use in secure auctions, to efficiently implement end-to-end verifiable voting. We propose a simple and very elegant combination of split-value representations with "randomized partial checking" (due to Jakobsson et al. [16]).
Subjects
Voting
End-to-end verifiable voting
Split-value representations
Randomized partial checking
Star-Vote
Persistent DSpace Link
