An optimally robust hybrid mix network
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Targeted Advertising ... And Privacy Too
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Electronic Jury Voting Protocols
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
The Security of a Mix-Center Based on a Semantically Secure Cryptosystem
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network
ISC '02 Proceedings of the 5th International Conference on Information Security
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Proceedings of the 11th ACM conference on Computer and communications security
Proceedings of the 11th ACM conference on Computer and communications security
A secure and private clarke tax voting protocol without trusted authorities
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Scratch & vote: self-contained paper-based cryptographic voting
Proceedings of the 5th ACM workshop on Privacy in electronic society
Anonymous communications in the Internet
Cluster Computing
How to break a practical MIX and design a new one
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A sender verifiable mix-net and a new proof of a shuffle
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficiently shuffling in public
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Cobra: toward concurrent ballot authorization for internet voting
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Internet voting system with cast as intended verification
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
| Hi-index | 0.00 |
We present Millimix, a mix network that is highly efficient on small input batches. The construction is conceptually simple, and both robust and private in the face of collusion by any minority set of malicious players. Additionally, Millimix the feature of being publicly verifiable. In other words, the mixing operation yields a transcript that demonstrates correctness to a third party that the mix proceeded correctly.