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

DOI10.1016/J.COSREV.2013.08.002MaRDI QIDQ395657zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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

Describes a project that uses

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)