Cryptology ePrint Archive: Report 2014/351

Secret and Verifiable Delegated Voting for Wide Representation

Yefim Leifman

Abstract: This paper combines cryptographic voting and web page ranking and proves that it is possible to hold elections so as not to limit a voter by a list of candidates, to benefit from voter's personal experience in dealing with people, to make wide and proportional representation, and to achieve secrecy, including incoercibility, and verifiability of cryptographic voting systems.

Category / Keywords: cryptographic protocols / election schemes, cryptographic voting, maximum entropy, mixnet, PageRank

Date: received 15 May 2014

Contact author: rankdemocracy at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140520:084126 (All versions of this report)

Short URL: ia.cr/2014/351

Discussion forum: Show discussion | Start new discussion