Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking

dc.contributor.author	Rivest, Ronald L.
dc.contributor.author	Rabin, Michael O.
dc.date.accessioned	2015-04-16T14:50:06Z
dc.date.available	2015-04-16T14:50:06Z
dc.date.issued	2014-04-03
dc.identifier.uri	http://hdl.handle.net/1721.1/96644
dc.description.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]).	en_US
dc.language.iso	en_US	en_US
dc.publisher	Caltech/MIT Voting Technology Project	en_US
dc.relation.ispartofseries	VTP Working Paper Series;122
dc.subject	Voting	en_US
dc.subject	End-to-end verifiable voting	en_US
dc.subject	Split-value representations	en_US
dc.subject	Randomized partial checking	en_US
dc.subject	Star-Vote	en_US
dc.title	Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking	en_US
dc.type	Working Paper	en_US