Fragile mixing

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2004, Pages 227-235

  Reiter, Michael K ^a   Wang, Xiaofeng ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Anonymity; Mix; Privacy; Unlinkability

Indexed keywords

COMMUNICATION SYSTEMS; CRYPTOGRAPHY; DATA PRIVACY; DATA TRANSFER; NETWORK PROTOCOLS; REAL TIME SYSTEMS; SECURITY OF DATA;

ANONYMITY; DECRYPTION; MIX SERVERS; UNLINKABILITY;

SERVERS;

EID: 14844299376     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1030083.1030114     Document Type: Conference Paper

References (31)

1. M. Abe. Universally verifiable MIX with verification work independent of the number of MIX servers. In Proceedings of EUROCRYPT 1998, volume 1403 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
2. M. Abe. Mix-networks on permutation networks. In Proceedings of ASIA CRYPT 1999, volume 1716 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
3. A. Acquisti, R. Dingledine, and P. Syverson. On the Economics of Anonymity. In Financial Cryptography (FC '03), 2003.
4. O. Berthold, H. Federrath, and M. Kohntopp. Project anonymity and unobservability in the internet. In Computers Freedom and Privacy Conference 2000 (CFP 2000) Workshop on Freedom and Privacy by Design, April 2000.
5. D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
6. G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, May 2003.
7. Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. In Proceedings of EUROCRYPT 2000, volume 1803 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
8. R. Dingledine, M. J. Freedman, D. Hopwood, and D. Molnar. A Reputation System to Increase MIX-net Reliability. In Proc. Financial Cryptography (FC '02). Springer-Verlag, 2002.
9. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology - Crypto '86, pages 186-194, New York, 1987. Springer-Verlag.
10. A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In Proc. 1992 AUSCRYPT, 1992.
11. J. Furukawa and K. Sako. An efficient scheme for proving a shuffling. In Proc. 2001 CRYPTO, volume 2139 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
12. O. Goldreich. The Foundations of Cryptography, volume 1. Cambridge University Press, 2001.
13. C. Gülcü and G. Tsudik. Mixing E-mail with Babel. In Proceedings of the Network and Distributed Security Symposium - NDSS '96, pages 2-16. IEEE, February 1996.
14. M. Jakobsson. A practical mix. In EUROCRYPT 98, 1998.
15. M. Jakobsson. Flash mixing. In Symposium on Principles of Distributed Computing, pages 83-89, 1999.
16. M. Jakobsson and A. Juels. Millimix: Mixing in small batches. In DIMACS Technical Report, June 1999.
17. M. Jakobsson and A. Juels. An optimally robust hybrid mix network (extended abstract). In Proceedings of Principles of Distributed Computing - PODC '01. ACM Press, 2001.
18. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In USENIX'02, 2002.
19. A. Jerichow, J. Müller, A. Pfitzmann, B. Pfitzmann, and M. Waidner. Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol. IEEE Journal on Selected Areas in Communications, 1998.
20. M. Mitomo and K. Kurosawa. Attack for flash mix. In Proc. 2000 ASIACRYPT, Lecture Notes on Computer Science. Springer-Verlag, 2000.
21. U. Möller and L. Cottrell. Mixmaster Protocol Version 2. Unfinished draft, January 2000.
22. A. Neff. A verifiable secret shuffle and its application to e-voting. In Proc. 2002 ACM conference on computer and communication security, 2001.
23. A. Neff. Verifiable Mixing (Shuffling) of ElGamal Pairs. Technical report, VOTEHERE, September 2003.
24. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Information and Communications Security - First International Conference, volume 1334, pages 440-444, Beijing, China, 11-14 1997. Springer-Verlag.
25. M. Ohkubo and M. Abe. A Length-Invariant Hybrid MIX. In Proceedings of ASIACRYPT 2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.
26. C. Park, K. Itoh, and K. Kurosawa. All/nothing election scheme and anonymous channel. In Proc. 1993 EUROCRYPT, 1993.
27. M. Reed, P. Syverson, and D. Goldschlag. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communication Special Issue on Copyright and Privacy Protection, 1998.
28. M. Rennhard and B. Plattner. Introducing MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection. In Proceedings of the Workshop on Privacy in the Electronic Society, Washington, DC, USA, November 2002.
29. P. S. Roger Dingledine, Nick Mathewson. Reliable MIX Cascade Networks through Reputation. In Proc. Financial Cryptography (FC '03). Springer-Verlag, 2003.
30. K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Proc. 1995 EUROCRYPT. Springer-Verlag, 1995.
31. Y. Tsiounis and M. Yung. On the security of ElGamal based Encryption. In Proceedings of PKC, 1998.