Towards a theory of anonymous networking

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Ghaderi, J ^a   Srikant, R ^a  

^a United States of America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE DELAY; COMMUNICATION NETWORKS; INFORMATION FLOWS; LATENCY CONSTRAINTS; MAXIMAL THROUGHPUT; MULTIPLE SOURCE; OPTIMAL MIXING; SINGLE OUTPUT; SOURCE-DESTINATION NODES;

INFORMATION THEORY; MIXING;

MIXERS (MACHINERY);

EID: 77953312635     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462155     Document Type: Conference Paper

References (22)

1. http://www.onion-router.net
2. http://www.torproject.org
3. D. Chaum, Untraceable electronic mail, return addresses and digital pseudonyms, Communications of the ACM, vol. 24, no. 2, pp. 84-88, February 1981.
4. D. Kesdogan, J. Egner, and R. Buschkes, Stop-and-go MIXes providing probabilistic security in an open system, Second International Workshop on Information Hiding, Lecture Notes in Computer Science, Springer-Verlag, pp. 83-98, April 1998.
5. A. Pfitzmann, B. Pfitzmann, and M. Waidner, ISDN-MIXes: Untraceable communication with very small bandwidth overhead, Proceedings of the GI/ITG Conference: Communication in Distributed Systems, Informatik-Fachberichte, vol. 267, (Mannheim, Germany), pp. 451-463, February 1991.
6. C. Gulcu and G. Tsudik, Mixing e-mail with babel, Proceedings of the Symposium on Network and Distributed System Security, pp. 2-19, February 1996.
7. M. K. Reiter and A. D. Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.
8. O. Berthold, H. Federrath, and S. Kopsell, Web MIXes: A system for anonymous and unobservable Internet access, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp. 115-129. Springer-Verlag, LNCS 2009, July 2000.
9. M. Rennhard and B. Plattner, Introducing morphmix: Peer-to-peer based anonymous internet usage with collusion detection, Proceedings of the Workshop on Privacy in the Electronic Society (WPES 2002), November 2002.
10. U. Moller, L. Cottrell, P. Palfrader, and L. Sassaman, Mixmaster Protocol, Version 2. Draft, July 2003.
11. G. Danezis, R. Dingledine, and N. Mathewson, Mixminion: Design of a type III anonymous remailer protocol, Proceedings of the 2003 IEEE Symposium on Security and Privacy, May 2003.
12. A. Beimel and S. Dolev, Buses for anonymous message delivery, Journal of Cryptology, vol. 16, no. 1, pp. 25-39, 2003.
13. C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, 1949.
14. C. Diaz, S. Seys, J. Claessens, and B. Preneel, Towards measuring anonymity, Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), Springer-Verlag, April 2002.
15. P. Venkitasubramaniam and V. Anantharam, On the Anonymity of Chaum Mixes, 2008 IEEE International Symposium on Information Theory, Toronto, Canada, July 2008.
16. P. Venkitasubramaniam, T. He and L. Tong, Anonymous Networking amidst Eavesdroppers, IEEE Transactions on Information Theory: Special Issue on Information-Theoretic Security, Vol. 54, No 6, pp. 2770-2784, June 2008.
17. T. Cover and J. Thomas, Elements of Information Theory, New York: Wiley, 1991.
18. J. Ghaderi and R. Srikant, Towards a theory of anonymous networking, Technical Report, avaiable online at http://www.ifp.illinois.edu/~jghaderi/ anonymity.pdf
19. D. P. Bertsekas, Dynamic programming and optimal control (1), Athena Scientific, 1995.
20. V. Vasilevich, Elements of combinatorial and differential topology, Graduate Studies in Mathematics, V. 74, 2006.
21. S. A. Lippman, Semi-Markov decision processes with unbounded rewards, Management Science, vol. 19, No. 7, pp. 717-731, March 1973.
22. L. Sennott, Average cost optimal stationary policies in infitie state markov decision processes with unbounded costs, Operations Research, Vol. 37, No. 4, pp. 626-633, August 1989.