Quantcast
Channel: Cryptology ePrint Archive
Viewing all articles
Browse latest Browse all 30214

Secret and Verifiable Delegated Voting for Wide Representation, by Yefim Leifman

$
0
0
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.

Viewing all articles
Browse latest Browse all 30214

Trending Articles