Paper 2014/351 Original: eprint.iacr.org/2014/351 ↗
Secret and Verifiable Delegated Voting for Wide Representation
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2014-05-20: last updated
- 2014-05-20: published
- Short URL
- https://ia.cr/2014/351
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/351,
author = {Yefim Leifman},
title = {Secret and Verifiable Delegated Voting for Wide Representation},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/351},
year = {2014},
url = {https://eprint.iacr.org/2014/351}
}