A Practical Voter-Verifiable Election Scheme
By David Chaum, Peter Y. A. Ryan, Steve A. Schneider. European Symposium on Research in Computer Security, 2005
408 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/3a850e89e97c002dbaf5664478485e7304412a54
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Zheng Yan
- Xixun Yu
- Stéphanie Delaune
- Athanasios V. Vasilakos
- Mark Dermot Ryan
- Steve Kremer
- Isabel Wagner
- David Eckhoff
In Computer Networks and Communications
- Zheng Yan
- Xixun Yu
- Stéphanie Delaune
- Athanasios V. Vasilakos
- Mark Dermot Ryan
- Steve Kremer
- Brij Bhooshan Gupta
- Isabel Wagner
Citations in the corpus
- A Survey of Verifiable Computation (2017, background): “Several schemes were proposed in the past decade, e.g., SureVote [58], Prêt-à-Voter [59] and Scratch&Vote [60].”
- Verifying privacy-type properties of electronic voting protocols (2009, background): “A third kind of scheme use s randomisation (for example by mixnets) to mix up the votes so that the link betwee n voter and vote is lost [17,18].”
- Coercion-resistant electronic elections (2005, neutral): “For some examples (but not by any means an exhaustive list), see [8, 15 ,18,22,23,28,32,38,42,47,50].”