Anonymous communication

Handbook of Financial Cryptography and Security

Volumn , Issue , 2010, Pages 341-390

  Danezis, George ^a   Diaz, Claudia ^b   Syverson, Paul ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS COMMUNICATION; BLIND SIGNATURES; ELECTRONIC PAYMENT; RESEARCH AND DEVELOPMENT;

ELECTRONIC MONEY;

EID: 80755144193     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420059823     Document Type: Chapter

References (200)

1. Masayuki Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In Kaisa Nyberg, editor, Advances in Cryptology-EUROCRYPT '98, pages 437-447, Helsinki, Finland, Springer-Verlag, Lecture Notes in Computer Science, 1403, 1998.
2. Alessandro Acquisti, Roger Dingledine, and Paul Syverson. On the economics of anonymity. In Rebecca N. Wright, editor, Financial Cryptography, 7th International Conference, FC 2003, pages 84-102. Springer-Verlag, Lecture Notes in Computer Science, 2742, 2003.
3. Ben Adida and Douglas Wikström. Obfuscated ciphertext mixing. Cryptology ePrint Archive, Report 2005/394, November 2005.
4. Dakshi Agrawal, Dogan Kesdogan, and Stefan Penz. Probabilistic treatment of mixes to hamper traffic analysis. In Proceedings, 2003 IEEE Symposium on Security and Privacy, pages 16-27. IEEE Computer Society, May 2003.
5. Ross Anderson. The eternity service. In 1st International Conference on the Theory and Applications of Cryptology (Pragocrypt '96), pages 242-252, Prague, Czech Republic, September/October 1996. Czech Technical University Publishing House.
6. Dmitri Asonov and Johann-Christoph Freytag. Almost optimal private information retrieval. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies:Second International Workshop, PET 2002, pages 239-243, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
7. Giuseppe Ateniese, Jan Camenisch, and Breno de Medeiros. Untraceable RFID tags via insubvertible encryption. In Catherine Meadows and Paul Syverson, editors, CCS’05: Proceedings of the 12th ACM Conference on Computer and Communications Security, pages 92-101. ACM Press, November 2005.
8. Adam Back, Ian Goldberg, and Adam Shostack. Freedom systems 2.0 security issues and analysis. White paper, Zero Knowledge Systems, Inc., October 2001. The attributed date is that printed at the head of the paper. The cited work is, however, superceded by documents that came before October 2001, e.g., [9].
9. Adam Back, Ian Goldberg, and Adam Shostack. Freedom systems 2.1 security issues and analysis. White paper, Zero Knowledge Systems, Inc., May 2001.
10. Adam Back, Ulf Möller, and Anton Stiglic. Traffic analysis attacks and trade-offs in anonymity providing systems. In Ira S. Moskowitz, editor, Information Hiding: 4th International Workshop, IH 2001, pages 245-257, Pittsburgh, PA, Springer-Verlag, Lecture Notes in Computer Science, 2137, April 2001.
11. Kevin Bauer, Damon McCoy, Dirk Grunwald, Tadayoshi Kohno, and Douglas Sicker. Low-resource routing attacks against Tor. In Ting Yu, editor, WPES’07: Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, pages 11-20. ACM Press, October 2007.
12. Amos Beimel and Shlomi Dolev. Buses for anonymous message delivery. Journal of Cryptology, 16(1):25-39, 2003.
13. Krista Bennett and Christian Grothoff. GAP-practical anonymous networking. In Roger Dingledine, editor, Privacy Enhancing Technologies: Third International Workshop, PET 2003, pages 141-160. Springer-Verlag, Lecture Notes in Computer Science, 2760, 2003.
14. Ron Berman, Amos Fiat, and Amnon Ta-Shma. Provable unlinkability against traffic analysis. In Ari Juels, editor, Financial Cryptography, 8th International Conference, FC 2004, pages 266-289. Springer-Verlag, Lecture Notes in Computer Science, 3110, February 2004.
15. Oliver Berthold, Hannes Federrath, and Stefan Köpsell. Web MIXes: A system for anonymous and unobservable Internet access. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 115-129. Springer-Verlag, Lecture Notes in Computer Science, 2009, July 2000.
16. Oliver Berthold and Heinrich Langos. Dummy traffic against long term intersection attacks. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies:Second International Workshop, PET 2002, pages 110-128, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
17. Oliver Berthold, Andreas Pfitzmann, and Ronny Standtke. The disadvantages of free MIX routes and how to overcome them. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 30-45. Springer-Verlag, Lecture Notes in Computer Science, 2009, July 2000.
18. John Bethencourt, Dawn Xiaodong Song, and Brent Waters. New constructions and practical applications for private stream searching (extended abstract). In 2006 IEEE Symposium on Security and Privacy (S& P 2006), Proceedings, pages 132-139. IEEE Computer Society, May 2006.
19. George Dean Bissias, Marc Liberatore, and Brian Neil Levine. Privacy vulnerabilities in encrypted HTTP streams. In George Danezis and David Martin, editors, Privacy Enhancing Technologies: 5th International Workshop, PET 2005, Cavtat Croatia, Springer-Verlag, Lecture Notes in Computer Science, 3856, 2005.
20. Avrim Blum, Dawn Xiaodong Song, and Shobha Venkataraman. Detection of interactive stepping stones: Algorithms and confidence bounds. In Erland Jonsson, Alfonso Valdes, and Magnus Almgren, editors, Recent Advances in Intrusion Detection 7th International Symposium, RAID 2004, pages 258-277, Sophia Antipolis, France, Springer-Verlag, Lecture Notes in Computer Science, 765, 2004.
21. Nikita Borisov. An analysis of parallel mixing with attacker-controlled inputs. In George Danezis and David Martin, editors, Privacy Enhancing Technologies: 5th International Workshop, PET 2005, pages 12-25, Cavtat Croatia, Springer-Verlag, Lecture Notes in Computer Science, 3856, 2005.
22. Nikita Borisov. Anonymous Routing in Structured Peer-to-Peer Overlays. Ph.D. thesis, University of California, Berkeley, 2005.
23. Philippe Boucher, Adam Shostack, and Ian Goldberg. Freedom systems 2.0 architecture. White paper, Zero Knowledge Systems, Inc., December 2000.
24. Justin Boyan. The Anonymizer: Protecting user privacy on the web. CMC Magazine, September 1997.
25. Zach Brown. Cebolla: Pragmatic IP Anonymity. In Proceedings of the 2002 Ottawa Linux Symposium, June 2002.
26. Jan Camenisch and Anna Lysyanskaya. A formal treatment of onion routing. In Victor Shoup, editor, Advances in Cryptology-CRYPTO 2005: 25th Annual International Cryptology Conference, pages 169-187. Springer-Verlag, Lecture Notes in Computer Science, 3621, August 2005.
27. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 4(2):84-88, February 1981.
28. David Chaum. Blind signatures for untraceable payments. In David Chaum, Ronald L. Rivest, and Alan T. Sherman, editors, Advances in Cryptology-CRYPTO '82, pages 199-203, New York and London, Plenum Press, 1983.
29. David Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, October 1985.
30. David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, 1988.
31. Heyning Cheng and Ron Avnur. Traffic analysis of ssl encrypted web browsing. http://citeseer.ist.psu.edu/656522.html.
32. Giusseppe Ciaccio. Improving sender anonymity in a structured overlay with imprecise routing. In George Danezis and Philippe Golle, editors, Privacy Enhancing Technologies:6th International Workshop, PET 2006, pages 190-207. Springer-Verlag, Lecture Notes in Computer Science, 4258, 2006.
33. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 46-66. Springer-Verlag, Lecture Notes in Computer Science, 2009, 2000.
34. Richard Clayton. Failure in a hybrid content blocking system. In George Danezis and David Martin, editors, Privacy Enhancing Technologies: 5th International Workshop, PET 2005, pages 78-92, Cavtat Croatia, Springer-Verlag, Lecture Notes in Computer Science, 3856, 2005.
35. Richard Clayton, Steven J. Murdoch, and Robert N. M. Watson. Ignoring the great firewall of China. In George Danezis and Philippe Golle, editors, Privacy Enhancing Technologies: 6th International Workshop, PET 2006, pages 20-35. Springer-Verlag, Lecture Notes in Computer Science, 4258, 2006.
36. George Danezis. Traffic analysis of the HTTP protocol over TLS. http://www.cl. cam.ac.uk/~gd216/TLSanon.pdf.
37. George Danezis. Forward secure mixes. In Jonsson Fisher-Hubner, editor, Nordic Workshop on Secure IT Systems (NordSec 2002), pages 195-207, Karlstad, Sweden, November 2002.
38. George Danezis. Mix-networks with restricted routes. In Roger Dingledine, editor, Privacy Enhancing Technologies: Third International Workshop, PET 2003, pages 1-17. Springer-Verlag, Lecture Notes in Computer Science, 2760, 2003.
39. George Danezis. Statistical disclosure attacks. In Gritzalis, Vimercati, Samarati, and Katsikas, editors, Security and Privacy in the Age of Uncertainty, (SEC2003), pages 421-426, Athens, IFIP TC11, Kluwer, May 2003.
40. George Danezis. The traffic analysis of continuous-time mixes. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004. Springer-Verlag, Lecture Notes in Computer Science, 3424, May 2005.
41. George Danezis. Breaking four mix-related schemes based on universal re-encryption. In Sokratis K. Katsikas, Javier Lopez, Michael Backes, Stefanos Gritzalis, and Bart Preneel, editors, Information Security 9th International Conference, ISC 2006, pages 46-59, Samos Island, Greece, Springer-Verlag, Lecture Notes in Computer Science, 4176, September 2006.
42. George Danezis and Richard Clayton. Route fingerprinting in anonymous communications. In Sixth IEEE International Conference on Peer-to-Peer Computing, P2P 2006, pages 69-72. IEEE Computer Society Press, 2006.
43. George Danezis and Jolyon Clulow. Compulsion resistant anonymous communications. In Mauro Barni, Jordi Herrera-Joancomartí, Stefan Katzenbeisser, and Fernando Pérez-González, editors, Information Hiding: 7th International Workshop, IH 2005, pages 11-25. Springer-Verlag, Lecture Notes in Computer Science, 3727, June 2005.
44. George Danezis and Claudia Diaz. Space-efficient private search with applications to rateless codes. In Sven Dietrich and Rachna Dahamija, editors, Financial Cryptography and Data Security, 11th International Conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, pages 148-162. Springer-Verlag, Lecture Notes in Computer Science, 4886, 2007.
45. George Danezis, Claudia Diaz, and Carmela Troncoso. Two-sided statistical disclosure attack. In Nikita Borisov and Philippe Golle, editors, Privacy Enhancing Technologies:7th International Symposium, PET 2007, pages 30-44. Springer-Verlag, Lecture Notes in Computer Science, 4776, 2007.
46. George Danezis, Roger Dingledine, and Nick Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In Proceedings, IEEE Symposium on Security and Privacy, pages 2-15, Berkeley, CA, IEEE Computer Society, May 2003.
47. George Danezis and Ben Laurie. Minx: A simple and efficient anonymous packet format. In Sabrina De Capitani di Vimercati and Paul Syverson, editors, WPES’04:Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pages 59-65, Washington, DC, ACM Press, October 2004.
48. George Danezis and Len Sassaman. Heartbeat traffic to counter (n - 1) attacks. In Pierangela Samarati and Paul Syverson, editors, WPES’03: Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, pages 89-93, Washington, DC, ACM Press, October 2003.
49. George Danezis and Andrei Serjantov. Statistical disclosure or intersection attacks on anonymity systems. In Jessica Fridrich, editor, Information Hiding: 6th International Workshop, IH 2004, pages 293-308. Springer-Verlag, Lecture Notes in Computer Science, 3200, May 2004.
50. George Danezis and Paul Syverson. Bridging and fingerprinting: Epistemic attacks on route selection. In Nikita Borisov and Ian Goldberg, editors, Privacy Enhancing Technologies: Eighth International Symposium, PETS 2008, pages 151-166. Springer-Verlag, Lecture Notes in Computer Science, 5134, July 2008.
51. Yvo Desmedt and Kaoru Kurosawa. How to break a practical MIX and design a new one. In Bart Preneel, editor, Advances in Cryptology-EUROCRYPT 2000, pages 557-572, Bruges, Belgium, Springer-Verlag, Lecture Notes in Computer Science, 1807, May 2000.
52. Claudia Diaz. Anonymity and Privacy in Electronic Services. Ph.D. thesis, Katholieke Universiteit Leuven, 2005.
53. Claudia Diaz, George Danezis, Christian Grothoff, Andreas Pfitzmann, and Paul F. Syverson. Panel discussion-mix cascades versus peer-to-peer: Is one concept superior? In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies:4th International Workshop, PET 2004, page 242. Springer-Verlag, Lecture Notes in Computer Science, 3424, 2005.
54. Claudia Diaz and Bart Preneel. Reasoning about the anonymity provided by pool mixes that generate dummy traffic. In Jessica Fridrich, editor, Information Hiding:6th International Workshop, IH 2004, pages 309-325. Springer-Verlag, Lecture Notes in Computer Science, 3200, May 2004.
55. Claudia Diaz, Len Sassaman, and Evelyne Dewitte. Comparison between two practical mix designs. In Pierangela Samarati, Peter Ryan, Dieter Gollmann, and Refik Molva, editors, Computer Security-ESORICS 2004, 9th European Symposium on Research in Computer Security, pages 141-159. Springer-Verlag, Lecture Notes in Computer Science, 3193, 2004.
56. Claudia Diaz and Andrei Serjantov. Generalising mixes. In Roger Dingledine, editor, Privacy Enhancing Technologies: Third International Workshop, PET 2003, pages 18-31, Dresden, Germany, Springer-Verlag, Lecture Notes in Computer Science, 2760, 2003.
57. Claudia Diaz, Stefaan Seys, Joris Claessens, and Bart Preneel. Towards measuring anonymity. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies:Second International Workshop, PET 2002, pages 54-68, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
58. Claudia Diaz, Carmela Troncoso, and George Danezis. Does additional information always reduce anonymity? In Ting Yu, editor, WPES’07: Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, pages 72-75. ACM Press, October 2007.
59. Claudia Diaz, Carmela Troncoso, and Andrei Serjantov. On the impact of social network proffling on anonymity. In Nikita Borisov and Ian Goldberg, editors, Privacy Enhancing Technologies: Eighth International Symposium, PETS 2008, pages 44-62. Springer-Verlag, Lecture Notes in Computer Science, 5134, July 2008.
60. T. Dierks and C. Allen. RFC 2246: The TLS protocol version 1.0. http://www.ietf. org/rfc/rfc2246.txt, January 1999.
61. Roger Dingledine, Michael J. Freedman, David Hopwood, and David Molnar. A reputation system to increase MIX-net reliability. In Ira S. Moskowitz, editor, Information Hiding: 4th International Workshop, IH 2001, pages 126-141, Pittsburgh, PA, Springer-Verlag, Lecture Notes in Computer Science, 2137, April 2001.
62. Roger Dingledine, Michael J. Freedman, and David Molnar. The free haven project:Distributed anonymous storage service. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 67-95. Springer-Verlag, Lecture Notes in Computer Science, 2009, 2000.
63. Roger Dingledine and Nick Mathewson. Anonymity loves company: Usability and the network effect. In Ross Anderson, editor, Fifth Workshop on the Economics of Information Security (WEIS 2006), June 2006.
64. Roger Dingledine and Nick Mathewson. Design of a blocking-resistant anonymity system (draft). https://www.torproject.org/svn/trunk/doc/design-paper/blocking.html, May 2007.
65. Roger Dingledine, Nick Mathewson, and Paul Syverson. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium, pages 303-319. USENIX Association, August 2004.
66. Roger Dingledine, Nick Mathewson, and Paul Syverson. Deploying low-latency anonymity: Design challenges and social factors. IEEE Security & Privacy, 5(5):83-87, September/October 2007.
67. Roger Dingledine, Andrei Serjantov, and Paul Syverson. Blending different latency traffic with alpha-mixing. In George Danezis and Philippe Golle, editors, Privacy Enhancing Technologies: 6th International Workshop, PET 2006, pages 245-257. Springer-Verlag, Lecture Notes in Computer Science, 4258, 2006.
68. Roger Dingledine, Vitaly Shmatikov, and Paul Syverson. Synchronous batching:From cascades to free routes. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004, pages 186-206. Springer-Verlag, Lecture Notes in Computer Science, 3424, May 2005.
69. Roger Dingledine and Paul Syverson. Reliable mix cascade networks through reputation. In Matt Blaze, editor, Financial Cryptography, 6th International Conference, FC 2002, pages 253-268. Springer-Verlag, Lecture Notes in Computer Science, 2357, 2003.
70. M. Dornseif. Government mandated blocking of foreign web content. In J. von Knop, W. Haverkamp, and E. Jessen, editors, Security, E-Learning, E-Services: Proceedings of the 17. DFN-Arbeitstagung uber Kommunikationsnetze, Dusseldorf, 2003.
71. John Douceur. The sybil attack. In Peter Druschel, M. Frans Kaashoek, and Antony I. T. Rowstron, editors, Peer-To-Peer Systems: First International Workshop, IPTPS 2002, pages 251-260, Cambridge, MA, Springer-Verlag, Lecture Notes in Computer Science, 2429, 2002.
72. Matthew Edman, Fikret Sivrikaya, and Bülent Yener. A combinatorial approach to measuring anonymity. In Gheorghe Muresan, Tayfur Altiok, Benjamin Melamed, and Daniel Zeng, editors, IEEE Intelligence and Security Informatics (ISI 2007), pages 356-363, IEEE, New Brunswick, NJ, May 2007.
73. Matthew Edman and Paul Syverson. AS-awareness in Tor path selection. In Somesh Jha, Angelos D. Keromytis, and Hao Chen, editors, CCS’09: Proceedings of the 16th ACM Conference on Computer and Communications Security. ACM Press, 2009.
74. Nathan S. Evans, Christian Grothoff, and Roger Dingledine. A practical congestion attack on Tor using long paths. In Proceedings of the 18th USENIX Security Symposium, pages 33-50, USENIX Association, Montreal, Canada, August 2009.
75. Peter Fairbrother. An improved construction for universal re-encryption. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004, pages 79-87. Springer-Verlag, Lecture Notes in Computer Science, 3424, May 2005.
76. N. Feamster, M. Balazinska, G. Harfst, H. Balakrishnan, and D. Karger. Infranet: Circumventing web censorship and surveillance. In Dan Boneh, editor, USENIX Security Symposium, pages 247-262, San Francisco, CA, 5-9 August 2002.
77. Nick Feamster, Magdalena Balazinska, Winston Wang, Hari Balakrishnan, and David Karger. Thwarting web censorship with untrusted messenger discovery. In Roger Dingledine, editor, Privacy Enhancing Technologies: Third International Workshop, PET 2003, pages 125-140. Springer-Verlag, Lecture Notes in Computer Science, 2760, 2003.
78. Nick Feamster and Roger Dingledine. Location diversity in anonymity networks. In Sabrina De Capitani di Vimercati and Paul Syverson, editors, WPES’04: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pages 66-76, Washington, DC, ACM Press, October 2004.
79. Joan Feigenbaum, Aaron Johnson, and Paul Syverson. Probabilistic analysis of onion routing in a black-box model [extended abstract]. In Ting Yu, editor, WPES’07:Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, pages 1-10. ACM Press, October 2007.
80. Laurent Fousse and Jean-Ren Reinhard. Nymbaron: A type iii nymserver. On-line, 2006. http://www.komite.net/laurent/soft/nymbaron/.
81. Michael J. Freedman and Robert Morris. Tarzan: A peer-to-peer anonymizing network layer. In Vijay Atluri, editor, Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, pages 193-206. ACM Press, 2002.
82. Michael J. Freedman, Emil Sit, Josh Cates, and Robert Morris. Introducing tarzan, a peer-to-peer anonymizing network layer. In Peter Druschel, M. Frans Kaashoek, and Antony I. T. Rowstron, editors, Peer-To-Peer Systems: First International Workshop, IPTPS 2002, pages 121-129, Cambridge, MA, Springer-Verlag, Lecture Notes in Computer Science, 2429, 2002.
83. Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In Joe Kilian, editor, Advances in Cryptology-CRYPTO 2001, pages 368-387, Santa Barbara, CA, Springer-Verlag, Lecture Notes in Computer Science, 2139, August 2001.
84. Benedikt Gierlichs, Carmela Troncoso, Claudia Diaz, Bart Preneel, and Ingrid Verbauwhede. Revisiting a combinatorial approach toward measuring anonymity. In Marianne Winslett, editor, WPES’08: Proceedings of the 2008 ACM Workshop on Privacy in the Electronic Society, pages 111-116, Alexandria, VA, ACM Press, October 2008.
85. Sharad Goel, Mark Robson, Milo Polte, and Emin Gun Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Technical Report 2003-1890, Cornell University, Ithaca, NY, February 2003.
86. Ian Goldberg. A Pseudonymous Communications Infrastructure for the Internet. Ph.D. thesis, University of California at Berkeley, 2000.
87. Ian Goldberg and Adam Shostack. Freedom 1.0 security issues and analysis. White paper, Zero Knowledge Systems, Inc., November 1999.
88. Ian Goldberg and Adam Shostack. Freedom network 1.0 architecture and protocols. White paper, Zero Knowledge Systems, Inc., October 2001. The attributed date is that printed at the head of the paper. The cited work is, however, superceded by documents that came before October 2001. The appendix indicates a change history with changes last made November 29, 1999. Also, in [87] the same authors refer to a paper with a similar title as an “April 1999 whitepaper.” [89] David M. Goldschlag, Michael G. Reed, and Paul F. Syverson. Hiding routing information. In Ross Anderson, editor, Information Hiding: First International Workshop, pages 137-150. Springer-Verlag, Lecture Notes in Computer Science, 1174, 1996.
89. Philippe Golle. Reputable mix networks. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004, pages 51-62. Springer-Verlag, Lecture Notes in Computer Science, 3424, May 2005.
90. Philippe Golle, Markus Jakobsson, Ari Juels, and Paul Syverson. Universal reencryption for mixnets. In Tatsuaki Okamoto, editor, Topics in Cryptology-CTRSA 2004, pages 163-178, San Francisco, Springer-Verlag, Lecture Notes in Computer Science, 2964, February 2004.
91. Philippe Golle and Ari Juels. Dining cryptographers revisited. In Advances in Cryptology-EUROCRYPT 2004, pages 456-473, Interlaken, Switzerland, Springer-Verlag, Lecture Notes in Computer Science, 3027, May 2004.
92. Philippe Golle and Ari Juels. Parallel mixing. In Birgit Pfitzmann and Peng Liu, editors, CCS 2004: Proceedings of the 11th ACM Conference on Computer and Communications Security, pages 220-226. ACM Press, October 2004.
93. Philippe Golle, XiaoFeng Wang, Markus Jakobsson, and Alex Tsow. Deterring voluntary trace disclosure in re-encryption mix networks. In 2006 IEEE Symposium on Security and Privacy (S& P 2006), Proceedings, pages 121-131, Oakland, CA, IEEE Computer Society, May 2006.
94. Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, and Ari Juels. Optimistic mixing for exit-polls. In Yuliang Zheng, editor, Advances in Cryptology-ASIACRYPT 2002, pages 451-465, Queenstown, New Zealand, 1-5 December 2002. Springer-Verlag, Lecture Notes in Computer Science, 2501.
95. Marcin Gomułkiewicz, Marek Klonowski, and Mirosław Kutyłlowski. Onions based on universal re-encryption-anonymous communication immune against repetitive attack. In Chae Hoon Lim and Moti Yung, editors, Information Security Applications, 5th International Workshop, WISA 2004, pages 400-410, Jeju Island, Korea, Springer-Verlag, Lecture Notes in Computer Science, 3325, August 2004.
96. Marcin Gomułkiewicz, Marek Klonowski, and Mirosław Kutyłowski. Rapid mixing and security of chaum’s visual electronic voting. In Einar Snekkenes and Dieter Gollmann, editors, Computer Security-ESORICS 2003, 8th European Symposium on Research in Computer Security, pages 132-145, Gjøvik, Norway, Springer-Verlag, Lecture Notes in Computer Science, 2808, October 2003.
97. Yong Guan, Xinwen Fu, Dong Xuan, P. U. Shenoy, Riccardo Bettati, and Wei Zhao. Netcamo: Camouaging network traffic for qos-guaranteed mission critical applications. IEEE Transactions on Systems, Man, and Cybernetics, Part A 31(4):253-265, 2001.
98. Ceki Gülcü and Gene Tsudik. Mixing E-mail with Babel. In Proceedings of the Symposium on Network and Distributed Security Symposium-NDSS '96, pages 2-16. IEEE, February 1996.
99. Joseph Y. Halpern and Kevin R. O’Neill. Anonymity and information hiding in multiagent systems. Jounal of Computer Security, 13(3):483-514, 2005.
100. Steven Hazel and Brandon Wiley. Achord: A variant of the chord lookup service for use in censorship resistant peer-to-peer publishing systems. In Peer-To-Peer Systems:First International Workshop, IPTPS 2002, Cambridge, MA, 2002. A postproceedings of this workshop was published by Springer-Verlag (Lecture Notes in Computer Science, 2429). This paper is not in that volume. It is only in the electronic proceedings available at http://www.iptps.org/papers.html#2002.
101. Sabine Helmers. A brief history of anon.penet.fi-the legendary anonymous remailer. CMC Magazine, September 1997.
102. Johan Helsingius. Johan Helsingius closes his internet remailer. http://www.penet. fi/press-english.html, August 1996.
103. Johan Helsingius. Temporary injunction in the anonymous remailer case. http://www.penet.fi/injuncl.html, September 1996.
104. Alejandro Hevia and Daniele Micciancio. An indistinguishability-based characterization of anonymous channels. In Nikita Borisov and Ian Goldberg, editors, Privacy Enhancing Technologies: Eighth International Symposium, PETS 2008, pages 24-43. Springer-Verlag, Lecture Notes in Computer Science, 5134, July 2008.
105. Andrew Hintz. Fingerprinting websites using traffic analysis. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies: Second International Workshop, PET 2002, pages 171-178, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
106. Nicholas Hopper, Eugene Y. Vasserman, and Eric Chan-Tin. How much anonymity does network latency leak? In Sabrina De Capitani di Vimercati, Paul Syverson, and David Evans, editors, CCS’07: Proceedings of the 14th ACM Conference on Computer and Communications Security, pages 82-91. ACM Press, 2007.
107. Dominic Hughes and Vitaly Shmatikov. Information hiding, anonymity and privacy:A modular approach. Journal of Computer Security, 12(1):3-36, 2004.
108. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Cryptography from anonymity. In FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 239-248, Washington, DC, IEEE Computer Society, 2006.
109. Markus Jakobsson. A practical mix. In Kaisa Nyberg, editor, Advances in Cryptology-EUROCRYPT '98, pages 448-461, Helsinki, Finland, Springer-Verlag, Lecture Notes in Computer Science, 1403, 1998.
110. Markus Jakobsson. Flash mixing. In PODC '99: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pages 83-89, Atlanta, Georgia, ACM Press, 1999.
111. Markus Jakobsson and Ari Juels. An optimally robust hybrid mix network. In PODC '01: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pages 284-292, New York, ACM, 2001.
112. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Dan Boneh, editor, Proceedings of the 11th USENIX Security Symposium, pages 339-353, San Francisco, CA, 5-9 August 2002. USENIX Association, 2002.
113. Anja Jerichow, Jan Müller, Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. Real-time MIXes: A bandwidth-efficient anonymity protocol. IEEE Journal on Selected Areas in Communications, 16(4):495-509, May 1998.
114. Shu Jiang, Nitin H. Vaidya, and Wei Zhao. Routing in packet radio networks to prevent traffic analsyis. In IEEE Information Assurance and Security Workshop, June 2000.
115. Aaron Johnson and Paul Syverson. More anonymous onion routing through trust. In Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium, pages 3-12, Washington, DC, July 8-10, 2009. IEEE Computer Society, 2009.
116. Aniket Kate, Greg Zaverucha, and Ian Goldberg. Pairing-based onion routing. In Nikita Borisov and Philippe Golle, editors, Privacy Enhancing Technologies: 7th International Symposium, PET 2007, pages 95-112. Springer-Verlag, Lecture Notes in Computer Science, 4776, 2007.
117. Sachin Katti, Dina Katabi, and Katay Puchala. Slicing the onion: Anonymous routing without pki. In Fourth Workshop on Hot Topics in Networks (HotNets-IV). ACM, 2005. http://conferences.sigcomm.org/hotnets/2005/papers/katti.pdf.
118. Dogan Kesdogan, Dakshi Agrawal, and Stefan Penz. Limits of anonymity in open environments. In Fabien A. P. Petitcolas, editor, Information Hiding: 5th International Workshop, IH 2002, pages 53-69, Noordwijkerhout, The Netherlands, Springer-Verlag, Lecture Notes in Computer Science, 2578, October 2002.
119. Dogan Kesdogan, Mark Borning, and Michael Schmeink. Unobservable surfing on the world wide web: Is private information retrieval an alternative to the MIX based approach? In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies:Second International Workshop, PET 2002, pages 214-218, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
120. Dogan Kesdogan, Jan Egner, and Roland Büschkes. Stop-and-Go MIXes: Providing probabilistic anonymity in an open system. In David Aucsmith, editor, Information Hiding: Second International Workshop, IH 1998, pages 83-98, Portland, OR, Springer-Verlag, Lecture Notes in Computer Science, 1525, April 1998.
121. Joe Kilian and Kazue Sako. Receipt-free MIX-type voting scheme-a practical solution to the implementation of a voting booth. In Louis C. Guillou and Jean-Jacques Quisquater, editors, Advances in Cryptology-EUROCRYPT '95, pages 393-403, Saint-Malo, France, Springer-Verlag, Lecture Notes in Computer Science, 921, May 1995.
122. Lea Kissner, Alina Oprea, Michael K. Reiter, Dawn Xiaodong Song, and Ke Yang. Private keyword-based push and pull with applications to anonymous communication. In Markus Jakobsson, MotiYung, and Jianying Zhou, editors, Applied Cryptography and Network Security Second International Conference, ACNS 2004, pages 16-30. Springer-Verlag, Lecture Notes in Computer Science, 3089, 2004.
123. Marek Klonowski, Mirosław Kutyłlowski, Anna Lauks, and Filip Zagórski. Universal re-encryption of signatures and controlling anonymous information ow. In WARTACRYPT '04 Conference on Cryptology, Bedlewo/Poznan, July 2004.
124. Marek Klonowski, Mirosław Kutyłlowski, and Filip Zagórski. Anonymous communication with on-line and off-line onion encoding. In Peter Vojtáš, Mária Bieliková, Bernadette Charron-Bost, and Ondrej Sýkora, editors, SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, pages 229-238, Liptovský Ján, Slovakia, Springer-Verlag, Lecture Notes in Computer Science, 3381, January 2005.
125. Marek Klonowski and Mirosław Kutyłowski. Provable anonymity for networks of mixes. In Mauro Barni, Jordi Herrera-Joancomartí, Stefan Katzenbeisser, and Fernando Pérez-González, editors, Information Hiding: 7th International Workshop, IH 2005, pages 26-38. Springer-Verlag, Lecture Notes in Computer Science, 3727, June 2005.
126. Stefan Köpsell and Ulf Hilling. How to achieve blocking resistance for existing systems enabling anonymous web surfing. In Sabrina De Capitani di Vimercati and Paul Syverson, editors, WPES’04: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pages 47-58, Washington, DC, ACM Press, October 2004.
127. Dennis Kügler. An analysis of GNUnet and the implications for anonymous, censorship-resistant networks. In Roger Dingledine, editor, Privacy Enhancing Technologies:Third International Workshop, PET 2003, pages 161-176. Springer-Verlag, Lecture Notes in Computer Science, 2760, 2003.
128. Brian N. Levine, Michael K. Reiter, Chenxi Wang, and Matthew K. Wright. Timing attacks in low-latency mix-based systems. In Ari Juels, editor, Financial Cryptography, 8th International Conference, FC 2004, pages 251-265. Springer-Verlag, Lecture Notes in Computer Science, 3110, February 2004.
129. Brian Neil Levine and Clay Shields. Hordes: a multicast based protocol for anonymity. Journal of Computer Security, 10(3):213-240, 2002.
130. John Leyden. Anonymizer looks for gaps in great firewall of China. The Register, April 3, 2006.
131. Tianbo Lu, Binxing Fang, Yuzhong Sun, and Xueqi Cheng. Performance analysis of WonGoo system. In Fifth International Conference on Computer and Information Technology (CIT 2005), pages 716-723, Shanghai, China, IEEE Computer Society, September 2005.
132. Tianbo Lu, Binxing Fang, Yuzhong Sun, and Li Guo. Some remarks on universal re-encryption and a novel practical anonymous tunnel. In Xicheng Lu and Wei Zhao, editors, Networking and Mobile Computing, Third International Conference, ICCNMC 2005, pages 853-862, Zhangjiajie, China, Springer-Verlag, Lecture Notes in Computer Science, 3619, 2005.
133. David Martin and Andrew Schulman. Deanonymizing users of the SafeWeb anonymizing service. Technical Report 2002-003, Boston University Computer Science Department, February 2002.
134. Nick Mathewson. Underhill: A proposed type 3 nymserver protocol specification. On-line, 2005. http://svn.conuropsis.org/nym3/trunk/doc/nym-spec.txt.
135. Nick Mathewson and Roger Dingledine. Practical traffic analysis: Extending and resisting statistical disclosure. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004. Springer-Verlag, Lecture Notes in Computer Science, 3424, 2005.
136. David Mazières and M. Frans Kaashoek. The Design, Implementation and Operation of an Email Pseudonym Server. In CCS’98-5th ACM Conference on Computer and Communications Security, pages 27-36, San Francisco, CA, ACM Press, November 1998.
137. Markus Michels and Patrick Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology-ASIACRYPT '96, pages 125-132, Kyongju, Korea, Springer-Verlag, Lecture Notes in Computer Science, 1163, November 1996.
138. Masashi Mitomo and Kaoru Kurosawa. Attack for ash MIX. In Tatsuaki Okamoto, editor, Advances in Cryptology-ASIACRYPT 2000, pages 192-204, Kyoto, Japan, Springer-Verlag, Lecture Notes in Computer Science, 1976, December 2000.
139. Prateek Mittal and Nikita Borisov. Information leaks in structured peer-to-peer anonymous communication systems. In Paul Syverson, Somesh Jha, and Xiaolan Zhang, editors, CCS’08: Proceedings of the 15th ACM Conference on Computer and Communications Security, pages 267-278. ACM Press, 2008.
140. Bodo Möller. Provably secure public-key encryption for length-preserving chaumian mixes. In Marc Joye, editor, Topics in Cryptology-CT-RSA 2003, pages 244-262, San Francisco, CA, 13-17, Springer-Verlag, Lecture Notes in Computer Science, 2612, April 2003.
141. Ulf Möller, Lance Cottrell, Peter Palfrader, and Len Sassaman. Mixmaster protocol-version 3. IETF Internet Draft, 2003.
142. Steven J. Murdoch and George Danezis. Low-cost traffic analysis of Tor. In 2005 IEEE Symposium on Security and Privacy (IEEE S&P 2005) Proceedings, pages 183-195. IEEE CS, May 2005.
143. Steven J. Murdoch and Piotr Zieliński. Sampled traffic analysis by internet-exchangelevel adversaries. In Nikita Borisov and Philippe Golle, editors, Privacy Enhancing Technologies: 7th International Symposium, PET 2007, pages 167-183. Springer-Verlag, Lecture Notes in Computer Science, 4776, 2007.
144. Arjun Nambiar and Matthew Wright. Salsa: A structured approach to large-scale anonymity. In Rebecca N. Wright, Sabrina De Capitani di Vimercati, and Vitaly Shmatikov, editors, CCS’06: Proceedings of the 13th ACM Conference on Computer and Communications Security, pages 17-26. ACM Press, 2006.
145. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In Pierangela Samarati, editor, Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS-8), pages 116-125, Philadelphia, PA, ACM Press, November 2001.
146. Richard E. Newman, Ira S. Moskowitz, Paul Syverson, and Andrei Serjantov. Metrics for traffic analysis prevention. In Roger Dingledine, editor, Privacy Enhancing Technologies:Third International Workshop, PET 2003, pages 48-65, Dresden, Germany, Springer-Verlag, Lecture Notes in Computer Science, 2760, March 2003.
147. Luke O’Connor. On blending attacks for mixes with memory. In Mauro Barni, Jordi Herrera-Joancomartí, Stefan Katzenbeisser, and Fernando Pérez-González, editors, Information Hiding: 7th International Workshop, IH 2005, pages 39-52. Springer-Verlag, Lecture Notes in Computer Science, 3727, June 2005.
148. Wakaha Ogata, Kaoru Kurosawa, Kazue Sako, and Kazunori Takatani. Fault tolerant anonymous channel. In Yongfei Han, Tatsuaki Okamoto, and Sihan Qing, editors, Information and Communication Security, First International Conference, ICICS '97, pages 440-444, Beijing, China, Springer-Verlag, Lecture Notes in Computer Science, 1334, November 1997.
149. Miyako Ohkubo and Masayuki Abe. A length-invariant hybrid mix. In Tatsuaki Okamoto, editor, Advances in Cryptology-ASIACRYPT 2000, pages 178-191, Kyoto, Japan, Springer-Verlag, Lecture Notes in Computer Science, 1976, December 2000.
150. Rafail Ostrovsky and William E. Skeith III. Private searching on streaming data. In Advances in Cryptology-CRYPTO 2005: 25th Annual International Cryptology Conference, pages 223-240. Springer-Verlag, Lecture Notes in Computer Science, 3621, 2005.
151. Lasse Øverlier and Paul Syverson. Locating hidden servers. In 2006 IEEE Symposium on Security and Privacy (S& P 2006), Proceedings, pages 100-114. IEEE CS, May 2006.
152. Lasse Øverlier and Paul Syverson. Improving efficiency and simplicty of Tor circuit establishment and hidden services. In Nikita Borisov and Philippe Golle, editors, Privacy Enhancing Technologies: 7th International Symposium, PET 2007, pages 134-152. Springer-Verlag, Lecture Notes in Computer Science, 4776, 2007.
153. Peter Palfrader. Echolot: a pinger for anonymous remailers. http://www.palfrader. org/echolot/.
154. Sameer Parekh. Prospects for remailers: where is anonymity heading on the internet? First Monday, 1(2), August 5, 1996. On-line journal http://www.firstmonday.dk/issues/issue2/remailers/.
155. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Tor Helleseth, editor, Advances in Cryptology-EUROCRYPT '93, pages 248-259. Springer-Verlag, Lecture Notes in Computer Science, 765, 1994.
156. Andreas Pfitzmann and Marit Köhntopp. Anonymity, unobservability, and pseudonymity-a proposal for terminology. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 1-9. Springer-Verlag, Lecture Notes in Computer Science, 2009, July 2000.
157. Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. ISDN-MIXes: Untraceable communication with very small bandwidth overhead. In Wolfgang Effelsberg, Hans Werner Meuer, and Günter Müller, editors, Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung, volume 267 of Informatik-Fachberichte, pages 451-463. Springer-Verlag, February 1991.
158. Andreas Pfitzmann and Michael Waidner. Networks without user observability-design options. In Franz Pichler, editor, Advances in Cryptology-EUROCRYPT '85, pages 245-253. Springer-Verlag, Lecture Notes in Computer Science, 219, 1986.
159. Birgit Pfitzmann. Breaking an efficient anonymous channel. In Alfredo De Santis, editor, Advances in Cryptology-EUROCRYPT '94, pages 332-340, Perugia, Italy, Springer-Verlag, Lecture Notes in Computer Science, 950, May 1994.
160. Birgit Pfitzmann and Andreas Pfitzmann. How to break the direct RSAimplementation of MIXes. In Jean-Jacques Quisquater and Joos Vandewalle, editors, Advances in Cryptology-EUROCRYPT '89, pages 373-381, Houthalen, Belgium, Springer-Verlag, Lecture Notes in Computer Science, 434, April 1990.
161. Charles Rackoff and Daniel R. Simon. Cryptographic defense against traffic analysis. In STOC '93: Proceedings of the Twenty-Ffth Annual ACM Symposium on Theory of Computing, pages 672-681, New York, ACM, 1993.
162. Josyula R. Rao and Pankaj Rohatgi. Can pseudonymity really guarantee privacy? In Proceedings of the 9th USENIX Security Symposium, pages 85-96. USENIX Association, August 2000.
163. Jean-François Raymond. Traffic analysis: Protocols, attacks, design issues, and open problems. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies:International Workshop on Design Issues in Anonymity and Unobservability, pages 10-29. Springer-Verlag, Lecture Notes in Computer Science, 2009, July 2000.
164. Michael G. Reed, Paul F. Syverson, and David M. Goldschlag. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications, 16(4):482-494, May 1998.
165. Michael Reiter and Aviel Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC), 1(1):66-92, 1998.
166. Michael Reiter and XiaoFeng Wang. Fragile mixing. In Birgit Pfitzmann and Peng Liu, editors, CCS 2004: Proceedings of the 11th ACM Conference on Computer and Communications Security, pages 227-235. ACM Press, October 2004.
167. Marc Rennhard and Bernhard Plattner. Introducing MorphMix: Peer-to-peer based anonymous internet usage with collusion detection. In Sabrina De Capitani di Vimercati and Pierangela Samarati, editors, Proceedings of the ACM Workshop on Privacy in the Electronic Society, WPES 2002, pages 91-102. ACM Press, 2002.
168. Len Sassaman, Bram Cohen, and Nick Mathewson. The Pynchon Gate: A secure method of pseudonymous mail retrieval. In Sabrina De Capitani di Vimercati and Roger Dingledine, editors, WPES’05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pages 1-9. ACM Press, October 2005.
169. Andrei Serjantov. Anonymizing censorship resistant systems. In Peter Druschel, M. Frans Kaashoek, and Antony I. T. Rowstron, editors, Peer-To-Peer Systems: First International Workshop, IPTPS 2002, pages 111-120, Cambridge, MA, Springer-Verlag, Lecture Notes in Computer Science, 2429, 2002.
170. Andrei Serjantov. On the Anonymity of Anonymity Systems. Ph.D. thesis, University of Cambridge, 2004.
171. Andrei Serjantov and George Danezis. Towards an information theoretic metric for anonymity. In Roger Dingledine and Paul Syverson, editors, Privacy Enhancing Technologies:Second International Workshop, PET 2002, pages 41-53, San Francisco, CA, Springer-Verlag, Lecture Notes in Computer Science, 2482, April 2002.
172. Andrei Serjantov, Roger Dingledine, and Paul Syverson. From a trickle to a ood:Active attacks on several mix types. In Fabien A.P. Petitcolas, editor, Information Hiding: 5th International Workshop, IH 2002, pages 36-52. Springer-Verlag, Lecture Notes in Computer Science, 2578, 2002.
173. Andrei Serjantov and Peter Sewell. Passive attack analysis for connection-based anonymity systems. In Einar Snekkenes and Dieter Gollmann, editors, Computer Security-ESORICS 2003, 8th European Symposium on Research in Computer Security, pages 141-159, Gjøvik, Norway, Springer-Verlag, Lecture Notes in Computer Science, 2808, October 2003.
174. Claude Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379-423 and 623-656, July and October 1948.
175. Rob Sherwood, Bobby Bhattacharjee, and Aravind Srinivasan. P5: A protocol for scalable anonymous communication. In Proceedings, 2002 IEEE Symposium on Security and Privacy, pages 58-72, Berkeley, CA, IEEE Computer Society, May 2002.
176. Erik Shimshock, Matt Staats, and Nick Hopper. Breaking and provably fixing minx. In Nikita Borisov and Ian Goldberg, editors, Privacy Enhancing Technologies: Eighth International Symposium, PETS 2008, pages 99-114. Springer-Verlag, Lecture Notes in Computer Science, 5134, July 2008.
177. Vitaly Shmatikov. Probabilistic analysis of anonymity. In 15th IEEE Computer Security Foundations Workshop, CSFW-15, pages 119-128, Cape Breton, Nova Scotia, Canada, IEEE Computer Society, June 2002.
178. Michael Singer. CIA Funded SafeWeb Shuts Down. Internet News. http://siliconvalley.internet.com/news/article.php/3531_926921, November 20 2001.
179. Qixiang Sun, Daniel R. Simon, Yi-Min Wang, Wilf Russell, Venkata N. Padmanabhan, and Lili Qiu. Statistical identification of encrypted web browsing traffic. In Proceedings, IEEE Symposium on Security and Privacy, pages 19-30. IEEE Computer Society, 2002.
180. Paul Syverson. Why I’m not an entropist. In Seventeenth International Workshop on Security Protocols. Springer-Verlag, Lecture Notes in Computer Science, Forthcoming.
181. Paul Syverson, Michael Reed, and David Goldschlag. Onion Routing access configurations. In Proceedings DARPA Information Survivability Conference & Exposition, DISCEX’00, volume 1, pages 34-40. IEEE CS Press, 1999.
182. Paul Syverson, Gene Tsudik, Michael Reed, and Carl Landwehr. Towards an analysis of onion routing security. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, pages 96-114. Springer-Verlag, Lecture Notes in Computer Science, 2009, July 2000.
183. Paul F. Syverson, David M. Goldschlag, and Michael G. Reed. Anonymous connections and onion routing. In Proceedings, 1997 IEEE Symposium on Security and Privacy, pages 44-54. IEEE CS Press, May 1997.
184. Paul F. Syverson and Stuart G. Stubblebine. Group principals and the formalization of anonymity. In Jeannette M. Wing, Jim Woodcock, and Jim Davies, editors, FM’99-Formal Methods, Vol. I, pages 814-833. Springer-Verlag, Lecture Notes in Computer Science, 1708, September 1999.
185. Parisa Tabriz and Nikita Borisov. Breaking the collusion detection mechanism of morphmix. In George Danezis and Philippe Golle, editors, Privacy Enhancing Technologies:6th International Workshop, PET 2006, pages 368-383. Springer-Verlag, Lecture Notes in Computer Science, 4258, 2006.
186. Brenda Timmerman. A security model for dynamic adaptive traffic masking. In NSPW '97: Proceedings of the 1997 Workshop on New Security Paradigms, pages 107-116, New York, ACM, 1997.
187. Brenda Timmerman. Secure dynamic adaptive traffic masking. In NSPW '99: Proceedings of the 1999 Workshop on New Security Paradigms, pages 13-24, New York, ACM, 2000.
188. Carmela Troncoso, Benedikt Gierlichs, Bart Preneel, and Ingrid Verbauwhede. Perfect matching disclosure attacks. In Nikita Borisov and Ian Goldberg, editors, Privacy Enhancing Technologies: Eighth International Symposium, PETS 2008, pages 2-23. Springer-Verlag, Lecture Notes in Computer Science, 5134, July 2008.
189. B. R. Venkatraman and Richard E. Newman-Wolfe. Performance analysis of a method for high level prevention of traffic analysis using measurements from a campus network. In Tenth Annual Computer Security Applications Conference, pages 288-297, Orlando, FL, IEEE CS Press, December 1994.
190. Michael Waidner and Birgit Pfitzmann. The dining cryptographers in the disco-underconditional sender and recipient untraceability with computationally secure serviceability. In Jean-Jacques Quisquater and Joos Vandewalle, editors, Advances in Cryptology-EUROCRYPT '89, page 690. Springer-Verlag, Lecture Notes in Computer Science, 434, 1990.
191. G. Walton. Chinas golden shield: Corporations and the development of surveillance technology in the Peoples Republic of China. Montreal: International Centre for Human Rights and Democratic Development, URL (consulted 29 October 2001): http: //www.ichrdd. ca/frame. iphtml, 2001.
192. Xinyuan Wang, Shiping Chen, and Sushil Jajodia. Tracking anonymous peer-to-peer voip calls on the internet. In Catherine Meadows and Paul Syverson, editors, CCS’05:Proceedings of the 12th ACM Conference on Computer and Communications Security, pages 81-91. ACM Press, November 2005.
193. Xinyuan Wang and Douglas S. Reeves. Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays. In Vijay Atluri and Peng Liu, editors, CCS 2003: Proceedings of the 10th ACM Conference on Computer and Communications Security, pages 20-29, Washington, DC, 2003.
194. Douglas Wikström. How to break, fix, and optimize “optimistic mix for exit-polls.” Technical Report T2002-24, Swedish Institute of Computer Science, SICS, Box 1263, SE-164 29 Kista, Sweden, 2002.
195. Douglas Wikström. Elements in Z*pnGq are dangerous. Technical Report T2003-05, Swedish Institute of Computer Science, SICS, Box 1263, SE-164 29 Kista, Sweden, 2003.
196. Douglas Wikström. Four practical attacks for “optimistic mixing for exit-polls.” Technical Report T2003-04, Swedish Institute of Computer Science, SICS, Box 1263, SE-164 29 Kista, Sweden, 2003.
197. Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. An analysis of the degradation of anonymous protocols. In Network and Distributed Security Symposium (NDSS '02), San Diego, CA, 6-8 February 2002. Internet Society.
198. Matthew Wright, Micah Adler, Brian Neil Levine, and Clay Shields. Defending anonymous communication against passive logging attacks. In Proceedings, 2003 IEEE Symposium on Security and Privacy, pages 28-43. IEEE Computer Society, May 2003.
199. Ye Zhu and Riccardo Bettati. Un-mixing mix traffic. In George Danezis and David Martin, editors, Privacy Enhancing Technologies: 5th International Workshop, PET 2005, Cavtat Croatia, Springer-Verlag, Lecture Notes in Computer Science, 3856, 2005.
200. Ye Zhu, Xinwen Fu, Bryan Graham, Riccardo Bettati, and Wei Zhao. On ow correlation attacks and countermeasures in mix networks. In David Martin and Andrei Serjantov, editors, Privacy Enhancing Technologies: 4th International Workshop, PET 2004. Springer-Verlag, Lecture Notes in Computer Science, 3424, May 2005.