STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Anonymity protocols as noisy channels
Information and Computation
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Scantegrity: End-to-End Voter-Verifiable Optical- Scan Voting
IEEE Security and Privacy
Civitas: Toward a Secure Voting System
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
SIAM Journal on Computing
Helios: web-based open-audit voting
SS'08 Proceedings of the 17th conference on Security symposium
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Prêt à voter: a voter-verifiable voting system
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A two-server, sealed-bid auction protocol
FC'02 Proceedings of the 6th international conference on Financial cryptography
A Game-Based Definition of Coercion-Resistance and Its Applications
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
Electing a university president using open-audit voting: analysis of real-world use of Helios
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Universally composable incoercibility
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Proving coercion-resistance of scantegrity II
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Some notions of entropy for cryptography
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Running mixnet-based elections with Helios
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Adapting helios for provable ballot privacy
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Quantifying Information Flow Using Min-Entropy
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Receipt-free universally-verifiable voting with everlasting privacy
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
An implementation of a mix-net based network voting scheme and its use in a private organization
Towards Trustworthy Elections
Distributed ElGamal à la Pedersen: Application to Helios
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Analysis of an electronic boardroom voting system
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
| Hi-index | 0.00 |
We propose a new measure for privacy of votes. Our measure relies on computational conditional entropy, an extension of the traditional notion of entropy that incorporates both information-theoretic and computational aspects. As a result, we capture in a unified manner privacy breaches due to two orthogonal sources of insecurity: combinatorial aspects that have to do with the number of participants, the distribution of their votes and published election outcome as well as insecurity of the cryptography used in an implementation. Our privacy measure overcomes limitations of two previous approaches to defining vote privacy and we illustrate its applicability through several case studies. We offer a generic way of applying our measure to a large class of cryptographic protocols that includes the protocols implemented in Helios. We also describe a practical application of our metric on Scantegrity audit data from a real election.