Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptotics

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 71-75

  Mishra, Abhishek ^a   Venkitasubramaniam, Parv ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCHING STRATEGY; CONVERGENCE RATES; INTERMEDIATE NODE; LIMITED BUFFERS; NETWORKED SYSTEMS; OPTIMAL STRATEGIES; RECURSIVE EQUATIONS; SOURCE IDENTITY;

INFORMATION THEORY;

EID: 84890390087     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620190     Document Type: Conference Paper

References (12)

1. A. Back, U. Moller, and A. Stiglic, "Traffic analysis attacks and tradeoffs in anonymity providing systems," in Proceedings of 4th International Information Hiding Workshop, (Pittsburg, PA), April 2001.
2. N. West, The SIGINT Secrets: The Signal Intelligence War: 1900 to Today. New York: William Morrow, 1988.
3. D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, vol. 24, pp. 84-88, February 1981.
4. L. Cottrell, "Mixmaster and Remailer Attacks," ¡http://www.obscura.com/loki/remailer/remailer-essay.html¿.
5. C. D́?az and A. Serjantov, "Generalizing mixes," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2003), Springer-Verlag, LNCS 2760, April 2003.
6. P. Venkitasubramaniam and V. Anantharam, "Anonymity of Mix Networks under Light Traffic Conditions," in Proceedings of the 36th Allerton Conf. on Communications, Control, and Computing, (Monticello, IL), October 2008.
7. A. Mishra and P. Venkitasubramaniam, "Anonymity of an Almost Fair Chaum Mix," in Proceedings of the 49th Allerton Conf. on Communications, Control, and Computing, October 2011.
8. P. Venkitasubramaniam, "Anonymity under Buffer Constraints," in IEEE International Conference on Communications, (Cape Town, South Africa), May 2010.
9. B. Dunn, M. Bloch, and J. Laneman, "Secure bits through queues," in Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on, pp. 37-41, june 2009.
10. M. Reed, P. Syverson, and D. Goldschlag, "Anonymous connections and onion routing," Selected Areas in Communications, IEEE Journal on, vol. 16, pp. 482-494, may 1998.
11. D. P. Bertsekas, Dynamic Programming and Optimal Control, vol. 1. Athena Scientific, 2nd ed., 2001.
12. A. Mishra and P. Venkitasubramaniam, "Source anonymity in fair scheduling: A case for the proportional method," in Communications (ICC), 2012 IEEE International Conference on, pp. 1118-1122, june 2012.