Full metadata
Title
A Verifiable Distributed Voting System Without a Trusted Party
Description
Cryptographic voting systems such as Helios rely heavily on a trusted party to maintain privacy or verifiability. This tradeoff can be done away with by using distributed substitutes for the components that need a trusted party. By replacing the encryption, shuffle, and decryption steps described by Helios with the Pedersen threshold encryption and Neff shuffle, it is possible to obtain a distributed voting system which achieves both privacy and verifiability without trusting any of the contributors. This thesis seeks to examine existing approaches to this problem, and their shortcomings. It provides empirical metrics for comparing different working solutions in detail.
Date Created
2021
Contributors
- Bouck, Spencer Joseph (Author)
- Bazzi, Rida (Thesis advisor)
- Boscovic, Dragan (Committee member)
- Shoshitaishvili, Yan (Committee member)
- Arizona State University (Publisher)
Topical Subject
Resource Type
Extent
70 pages
Language
eng
Copyright Statement
In Copyright
Primary Member of
Peer-reviewed
No
Open Access
No
Handle
https://hdl.handle.net/2286/R.2.N.161779
Level of coding
minimal
Cataloging Standards
Note
Partial requirement for: M.S., Arizona State University, 2021
Field of study: Computer Science
System Created
- 2021-11-16 03:56:26
System Modified
- 2021-11-30 12:51:28
- 2 years 11 months ago
Additional Formats