Secret-ballot receipts: True voter-verifiable elections
By David Chaum. IEEE Security & Privacy Magazine, 2004
539 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/ecc468de3b8eecfc1bee31d7f744d64a49e79199
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
- Steve A. Schneider
- Peter Y. A. Ryan
- Zheng Yan
- Athanasios V. Vasilakos
- Xixun Yu
- David Chaum
- Aviel D. Rubin
- Tadayoshi Kohno
In Computer Vision and Pattern Recognition
- Steve A. Schneider
- Peter Y. A. Ryan
- Zheng Yan
- Athanasios V. Vasilakos
- Tadayoshi Kohno
- D. Wallach
- Mihir Bellare
Citations in the corpus
- Analysis of an electronic voting system (2004, background): “…the 2004 IEEE Symposium on Security and Privacy (S&P’04) 1081-6011/04 $ 20.00 © 2004 IEEE party introduces flaws into the voting system software or takes advantage of pre-existing flaws, then the results of the election cannot be assured to accurately reflect the votes legally cast by the voters.”
- A Practical Voter-Verifiable Election Scheme (2005, methodology): “The original scheme of [3] uses visual cryptography to encrypt the receipts and perform the decryption in the booth.”
- Verifying privacy-type properties of electronic voting protocols (2009, unknown): “A third kind of scheme uses randomisation (for example by mixnets) to mix up the votes so that the link between voter and vote is lost [16] [17].”
- A Survey of Verifiable Computation (2017, background): “The notion of end-to-end voting was first proposed to ensure the verifiability of voting systems [58].”
- Coercion-resistant electronic elections (2005, unknown): “Wagner [31] have identified vulnerabilities in the influential and innovative schemes of Chaum and Neff [ 20 ,39].”