Probabilistic treatment of MIXes to hamper traffic analysis

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2003, Pages 16-27

  Agrawal, Dakshi ^a   Kesdogan, Dogan ^b   Penz, Stefan ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PRIVACY; CONGESTION CONTROL (COMMUNICATION); DATA PRIVACY; PROBABILITY DISTRIBUTIONS; REQUIREMENTS ENGINEERING; STATISTICAL METHODS; TELECOMMUNICATION TRAFFIC; TIME SHARING PROGRAMS; USER INTERFACES;

PROBABILISTIC TREATMENT; TRAFFIC INFORMATION; WEAK OPERATIONAL MODES;

SECURITY OF DATA;

EID: 0038148419     PISSN: 10637109     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers," In Advances in Cryptology, Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science, pages 437-447, Helsinki, Finland, 31 May, 4. June 1998. Springer-Verlag.
2. M. Abe, "Mix-network on permutation networks," In Advances in cryptology ASIACRYPT '99, volume 1716, pages 258-273. Springer-Verlag, 1999.
3. O. Berthold, H. Federrath, and S. Köpsell, "Web MIXes: A System for Anonymous and Unobservable Internet Access," International Workshop on Design Issues in Anonymity and Unobservability, Berkley, 2009 LNCS, Springer-Verlag, 2001.
4. D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the A.C.M., 24(2):84-88, February 1981
5. D. Chaum, "The dining cryptographers problem: Unconditional sender and recipient untraceability," Journal of Cryptology, 1:65-75, 1988.
6. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan: "Private information retrieval," In 36th IEEE Conference on the Foundations of Computer Science, pages 41-50. IEEE Computer Society Press, 1995.
7. D. A. Cooper and K. P. Birman: "Preserving privacy in a network of mobile computers," In 1995 IEEE Symposium on Research in Security and Privacy, pages 26-38. IEEE Computer Society Press, 1995.
8. L. Cottrell: "Mixmaster," http://www.obscura.com/loki/.
9. H. Federrath, A. Jerichow, A. Pfitzmann: "MIXes in Mobile Communication Systems: Location Management with Privacy," Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 121-135.
10. I. Goldberg and A. Shostack: "Freedom network whitepapers".
11. C. Gulcu and G. Tsudik: "Mixing E-mail with BABEL," In Symposium on Network and Distributed Systems Security (NDSS '96), San Diego, California, February 1996.
12. Y. Guan, X. Fu, R. Bettati, and W. Zhao: "An Optimal Strategy for Anonymous Communication Protocols," Proceedings of the 22th International Conference on Distributed Computing Systems, Vienna, Austria, July 2002.
13. A. Jerichow, J. Müller, A. Pfitzmann, B. Pfitzmann, M. Waidner: "Real-Time Mixes: A Bandwidth-Efficient Anonymity Protocol," IEEE Journal on Selected Areas in Communications, 1998.
14. P. A. Karger: "Non-Discretionary Access Control for Decentralized Computing Systems", Master Thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, 545 Technology Square, Cambridge, Massachusetts 02139, Mai 1977, Report MIT/LCS/TR-179.
15. D. Kesdogan, D. Agrawal and S. Penz: "Limits of Anonymity in Open Environments," IH 2002, 5th international workshop on information hiding, Noordwijkerhout, The Netherlands, 7-9 October 2002. Lecture Notes in Computer Science (to be published), Springer-Verlag, 2002
16. D. Kesdogan, J. Egner, and R. Büschkes, "Stop-and-go mixes providing probabilistic security in an open system," In David Aucsmith, editor, Information Hiding: Second International Workshop, volume 1525 of Lecture Notes in Computer Science, pages 83-98, Springer-Verlag, Berlin, Germany, 1998.
17. A. Pfitzmann, B. Pfitzmann, and M. Waidner: ISDN-mixes: "Untraceable communication with very small bandwidth overhead," In GI/ITG Conference: Communication in Distributed Systems, pages 451-463. Springer-Verlag, Heidelberg 1991, February 1991.
18. A. Pfitzmann and M. Waidner, "Networks without user observability, design options. In Advances in Cryptology," Eurocrypt '85, volume 219 of Lecture Notes in Computer Science, Springer-Verlag, 1985.
19. M. K. Reiter and A. D. Rubin: "Crowds: Anonymity for Web Transactions," ACM Transactions on Information and System Security, volume 1, pages 66-92, 1998.
20. M. G. Reed, P F Syverson, and D M Goldschlag: "Anonymous connections and onion routing," IEEE Journal on Special Areas in Communications, 14(4):482-494, May 1998.
21. M. G. Reed, P. F. Syverson, and D. M. Goldschlag: "Protocols using Anonymous Connections: Mobile Applications, Security Protocols," 5th International Workshop Proceedings, B. Christianson, B. Crispo, M. Lomas, and M. Roe (editors), Springer-Verlag LNCS 1361, 13-23, 1998.
22. C. Shields and B. N. Levine: "A Protocol for Anonymous Communication Over the Internet," Proceedings of the 7th ACM Conference on Computer and Communication Security, Athens, Greece, 1-4, November 2000.
23. P. Syverson, G. Tsudik, M. Reed, and C. Landwehr: "Towards an Analysis of Onion Routing Security," Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000.