Authors: Alejandro Hevia, and Marcos Kiwi
Abstract: This work elicits the fact that all current proposals for electronic voting schemes disclose the final tally of the votes. In certain situations, like jury voting, this may be undesirable. We present a robust and universally verifiable Membership Testing Scheme (MTS) that allows, among other things, a collection of voters to cast votes and determine whether their tally belongs to some pre-specified set (eg., exceeds a given threshold) - our scheme discloses no additional information than that implied from the knowledge of such membership. We discuss several extensions of our basic MTS. All the constructions presented combine features of two parallel lines of research concerning electronic voting schemes, those based on MIX-networks and in homomorphic encryption.
In Theoretical Computer Science
Volume 321, Issue 1 , 16 June 2004, Pages 73-94
Latin American Theoretical Informatics (available
from Elsevier Science).
An abstract of this work also appeared in Proceedings of 5-rd Latin American Symposium on Theoretical Informatics - LATIN 2002, LNCS 2286, pages 415-429, Springer-Verlag, 2002.
A preliminar version of this work appeared in Cryptology ePring archive: Technical Report number 2000/035, July 17, 2000.
Full version: Available as Postscript, Compressed Postscript or PDF.