Absolute privacy in voting

DOI10.1007/3-540-45439-X_7MaRDI QIDQ4448389zbMATH OpenFDO

Authors Dmitri Asonov, Markus Schaal, Johann Christoph Freytag

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2200/22000095.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• On some incompatible properties of voting schemes
• A practical secret voting scheme for large scale elections
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Financial Cryptography
• Receipt-free secret-ballot elections (extended abstract)

Cited in

(14)

• When are three voters enough for privacy properties?
• An information-theoretic model of voting systems
• Vote-independence: a powerful privacy notion for voting protocols
• Self-tallying elections and perfect ballot secrecy
• Role interchange for anonymity and privacy of voting
• On the complexity of the minimum independent set partition problem
• Unconditionally secure electronic voting
• On some incompatible properties of voting schemes
• Anonymity in voting revisited
• Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting
• The Power of Anonymous Veto in Public Discussion
• Information Security
• Financial Cryptography and Data Security
• Private polling in elections and voter welfare

This page was built for publication: Absolute privacy in voting

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