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

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]).