Privacy and verifiability in voting systems: methods, developments and trends

DOI10.1016/J.COSREV.2013.08.002zbMATH Open1279.68073OpenAlexW1991061563MaRDI QIDQ395657FDOQ395657

Authors: Hugo Jonker, Sjouke Mauw, Jun Pang 

Publication date: 29 January 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2013.08.002

Recommendations

• Surveying global verifiability
• Relations between privacy, verifiability, accountability and coercion-resistance in voting protocols
• On some incompatible properties of voting schemes
• An information-theoretic model of voting systems
• One vote is enough for analysing privacy

zbMATH Keywords

privacyvoting systemscoercion-resistanceend-to-end verifiabilityreceipt-freeness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data encryption (aspects in computer science) (68P25) Voting theory (91B12)

Cites Work

• Probabilistic encryption
• Fully homomorphic encryption using ideal lattices
• A method for obtaining digital signatures and public-key cryptosystems
• How to share a secret
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Nonmalleable Cryptography
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Multi-authority secret-ballot elections with linear work
• Receipt-free secret-ballot elections (extended abstract)
• Designated verifier proofs and their applications
• Title not available (Why is that?)
• Practical multi-candidate election system
• Vote-independence: a powerful privacy notion for voting protocols
• An implementation of a universally verifiable electronic voting scheme based on shuffling
• Benaloh's dense probabilistic encryption revisited
• Efficent receipt-free voting based on homomorphic encryption
• A formal framework for quantifying voter-controlled privacy
• Formalising Receipt-Freeness
• On some incompatible properties of voting schemes
• On the security of public key protocols
• A practical secret voting scheme for large scale elections
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programming Languages and Systems
• Selected Areas in Cryptography
• Information Security and Cryptology - ICISC 2003
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy

Cited In (3)

• On the notion of ‘software independence’ in voting systems
• Surveying global verifiability
• Relations between privacy, verifiability, accountability and coercion-resistance in voting protocols

Uses Software

• Helios

This page was built for publication: Privacy and verifiability in voting systems: methods, developments and trends

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395657)