Elements of information theory
Elements of information theory
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
On the design and quantification of privacy preserving data mining algorithms
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
Self-tallying Elections and Perfect Ballot Secrecy
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a privacy measurement criterion for voting systems
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
IEEE Transactions on Information Theory
| Hi-index | 0.98 |
This paper presents an information-theoretic model of a vote counting system, and well-defined criteria for evaluating such a system with respect to integrity, privacy and verifiability. The impossibility of achieving perfect integrity, perfect verifiability and perfect privacy follows easily from the information-theoretic approach. The model is applied to the measurement of privacy loss in the ThreeBallot and Farnel voting systems, and finds both systems to have similar privacy loss.