Welcome to the resource topic for 2014/351
Title:
Secret and Verifiable Delegated Voting for Wide Representation
Authors: 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.
ePrint: https://eprint.iacr.org/2014/351
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .