{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T14:32:29Z","timestamp":1774189949138,"version":"3.50.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["EIA-0080119ANI-0087482ANI-0296194CNS-0549998"],"award-info":[{"award-number":["EIA-0080119ANI-0087482ANI-0296194CNS-0549998"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["EIA-0080119ANI-0087482ANI-0296194CNS-0549998"],"award-info":[{"award-number":["EIA-0080119ANI-0087482ANI-0296194CNS-0549998"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000074","name":"U.S. Department of Justice","doi-asserted-by":"publisher","award":["2000-DT-CX-K001"],"award-info":[{"award-number":["2000-DT-CX-K001"]}],"id":[{"id":"10.13039\/100000074","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>Using analysis, simulation, and experimentation, we examine the threat against anonymous communications posed by passive-logging attacks. In previous work, we analyzed the success of such attacks under various assumptions. Here, we evaluate the effects of these assumptions more closely. First, we analyze the Onion Routing-based model used in prior work in which a fixed set of nodes remains in the system indefinitely. We show that for this model, by removing the assumption of uniformly random selection of nodes for placement in the path, initiators can greatly improve their anonymity. Second, we show by simulation that attack times are significantly lower in practice than bounds given by analytical results from prior work. Third, we analyze the effects of a dynamic membership model, in which nodes are allowed to join and leave the system; we show that all known defenses fail more quickly when the assumption of a static node set is relaxed. Fourth, intersection attacks against peer-to-peer systems are shown to be an additional danger, either on their own or in conjunction with the predecessor attack. Finally, we address the question of whether the regular communication patterns required by the attacks exist in real traffic. We collected and analyzed the Web requests of users to determine the extent to which basic patterns can be found. We show that, for our study, frequent and repeated communication to the same Web site is common.<\/jats:p>","DOI":"10.1145\/1330332.1330335","type":"journal-article","created":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T14:02:33Z","timestamp":1204207353000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Passive-Logging Attacks Against Anonymous Communications Systems"],"prefix":"10.1145","volume":"11","author":[{"given":"Matthew K.","family":"Wright","sequence":"first","affiliation":[{"name":"University Of Texas At Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micah","family":"Adler","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian Neil","family":"Levine","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clay","family":"Shields","sequence":"additional","affiliation":[{"name":"Georgetown University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"<\/scp>","author":"B\u00e4cher P.","year":"2005","unstructured":"<scp> B\u00e4cher , P. , Holz , T. , K\u00f6tter , M. , and Wicherski , G . <\/scp> 2005 . Know your enemy: Tracking botnets. http:\/\/www.honeynet.org\/papers\/bots. The Honeynet Project and Research Alliance . <scp>B\u00e4cher, P., Holz, T., K\u00f6tter, M., and Wicherski, G.<\/scp> 2005. Know your enemy: Tracking botnets. http:\/\/www.honeynet.org\/papers\/bots. The Honeynet Project and Research Alliance."},{"key":"e_1_2_1_2_1","volume-title":"<\/scp>","author":"Back A.","year":"2000","unstructured":"<scp> Back , A. , Goldberg , I. , and Shostack , A . <\/scp> 2000 . Freedom 2.0 security issues and analysis. White paper. Zero-Knowledge Systems, Inc . <scp>Back, A., Goldberg, I., and Shostack, A.<\/scp> 2000. Freedom 2.0 security issues and analysis. White paper. Zero-Knowledge Systems, Inc."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCW.2005.17"},{"key":"e_1_2_1_4_1","volume-title":"<\/scp>","author":"Bauer K.","year":"2007","unstructured":"<scp> Bauer , K. , McCoy , D. , Grunwald , D. , Kohno , T. , and Sicker , D . <\/scp> 2007 . Low-resource routing attacks against anonymous systems. Tech. rep. CU-CS-1025-07, University of Colorado at Boulder. <scp>Bauer, K., McCoy, D., Grunwald, D., Kohno, T., and Sicker, D.<\/scp> 2007. Low-resource routing attacks against anonymous systems. Tech. rep. CU-CS-1025-07, University of Colorado at Boulder."},{"key":"e_1_2_1_5_1","volume-title":"<\/scp>","author":"Bellissimo A.","year":"2004","unstructured":"<scp> Bellissimo , A. , Shenoy , P. , and Levine , B. N . <\/scp> 2004 . Exploring the use of BitTorrent as the basis for a large trace repository. Tech. rep. 04-41, Department of Computer Science, University of Massachusetts at Amherst. <scp>Bellissimo, A., Shenoy, P., and Levine, B. N.<\/scp> 2004. Exploring the use of BitTorrent as the basis for a large trace repository. Tech. rep. 04-41, Department of Computer Science, University of Massachusetts at Amherst."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/332186.332211"},{"key":"e_1_2_1_7_1","volume-title":"<\/scp>","author":"Berthold O.","year":"2002","unstructured":"<scp> Berthold , O. and Langos , H . <\/scp> 2002 . Dummy traffic against long term intersection attacks. In &lt;it&gt;Proceedings of Workshop on Privacy Enhancing Technologies (PET '02)&lt;\/it&gt;. 110--128. <scp>Berthold, O. and Langos, H.<\/scp> 2002. Dummy traffic against long term intersection attacks. In &lt;it&gt;Proceedings of Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. 110--128."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767831_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_2_1_10_1","volume-title":"<\/scp>","author":"Chu J.","year":"2002","unstructured":"<scp> Chu , J. , Labonte , K. , and Levine , B. N . <\/scp> 2002 . Availability and locality measurements of peer-to-peer file systems. In &lt;it&gt;Proceedings ITCom: Scalability and Traffic Control in IP Networks II Conference &lt;\/it&gt;. Vol. SPIE 4868 . 310--321. <scp>Chu, J., Labonte, K., and Levine, B. N.<\/scp> 2002. Availability and locality measurements of peer-to-peer file systems. In &lt;it&gt;Proceedings ITCom: Scalability and Traffic Control in IP Networks II Conference&lt;\/it&gt;. Vol. SPIE 4868. 310--321."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"<scp>Danezis G.<\/scp> 2003. Statistical disclosure attacks: Traffic confirmation in open environments. In &lt;it&gt;Proceedings of Security and Privacy in the Age of Uncertainty (SEC'03)&lt;\/it&gt;. 421--426.  <scp>Danezis G.<\/scp> 2003. Statistical disclosure attacks: Traffic confirmation in open environments. In &lt;it&gt;Proceedings of Security and Privacy in the Age of Uncertainty (SEC'03)&lt;\/it&gt;. 421--426.","DOI":"10.1007\/978-0-387-35691-4_40"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11423409_3"},{"key":"e_1_2_1_13_1","volume-title":"<\/scp>","author":"Danezis G.","year":"2003","unstructured":"<scp> Danezis , G. , Dingledine , R. , and Mathewson , N . <\/scp> 2003 . Mixminion: design of a type III anonymous remailer protocol. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy &lt;\/it&gt;. 2--15. <scp>Danezis, G., Dingledine, R., and Mathewson, N.<\/scp> 2003. Mixminion: design of a type III anonymous remailer protocol. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy&lt;\/it&gt;. 2--15."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/513338.513380"},{"key":"e_1_2_1_15_1","volume-title":"<\/scp>","author":"D\u00edaz C.","year":"2002","unstructured":"<scp> D\u00edaz , C. , Seys , S. , Claessens , J. , and Preneel , B . <\/scp> 2002 . Towards measuring anonymity. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET '02)&lt;\/it&gt;. 184--188. <scp>D\u00edaz, C., Seys, S., Claessens, J., and Preneel, B. <\/scp> 2002. Towards measuring anonymity. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. 184--188."},{"key":"e_1_2_1_16_1","volume-title":"<\/scp>","author":"Diaz F.","year":"2003","unstructured":"<scp> Diaz , F. and Allan , J . <\/scp> 2003 . Browsing-based user language models for information retrieval. Tech. rep. CIIR IR-279, University of Massachusetts at Amherst. <scp>Diaz, F. and Allan, J.<\/scp> 2003. Browsing-based user language models for information retrieval. Tech. rep. CIIR IR-279, University of Massachusetts at Amherst."},{"key":"e_1_2_1_17_1","volume-title":"<\/scp>","author":"Dingledine R.","year":"2007","unstructured":"<scp> Dingledine , R. and Mathewson , N . <\/scp> 2007 . Tor path specification. http:\/\/tor.eff.org\/svn\/trunk\/doc\/spec\/path-spec.txt. <scp>Dingledine, R. and Mathewson, N.<\/scp> 2007. Tor path specification. http:\/\/tor.eff.org\/svn\/trunk\/doc\/spec\/path-spec.txt."},{"key":"e_1_2_1_18_1","volume-title":"<\/scp>","author":"Dingledine R.","year":"2004","unstructured":"<scp> Dingledine , R. , Mathewson , N. , and Syverson , P . <\/scp> 2004 . TOR : The next-generation onion router. In &lt;it&gt;Proceedings of USENIX Security Symposium &lt;\/it&gt;. 303---320. <scp>Dingledine, R., Mathewson, N., and Syverson, P.<\/scp> 2004. TOR: The next-generation onion router. In &lt;it&gt;Proceedings of USENIX Security Symposium&lt;\/it&gt;. 303---320."},{"key":"e_1_2_1_19_1","volume-title":"The Sybil attack. In &lt;it&gt;Revised Papers from the 1st International Workshop on Peer-to-Peer Systems&lt;\/it&gt;","author":"Douceur J. R.","unstructured":"<scp> Douceur , J. R. <\/scp> 2002. The Sybil attack. In &lt;it&gt;Revised Papers from the 1st International Workshop on Peer-to-Peer Systems&lt;\/it&gt; . Springer-Verlag , 251--260. <scp>Douceur, J. R.<\/scp> 2002. The Sybil attack. In &lt;it&gt;Revised Papers from the 1st International Workshop on Peer-to-Peer Systems&lt;\/it&gt;. Springer-Verlag, 251--260."},{"key":"e_1_2_1_20_1","unstructured":"<scp>Duchamp D.<\/scp> 1999. Prefetching hyperlinks. In &lt;it&gt;Proceedings of the USENIX Symposium on Internet Technologies and Systems&lt;\/it&gt;. 127--138.   <scp>Duchamp D.<\/scp> 1999. Prefetching hyperlinks. In &lt;it&gt;Proceedings of the USENIX Symposium on Internet Technologies and Systems&lt;\/it&gt;. 127--138."},{"key":"e_1_2_1_21_1","volume-title":"<\/scp>","author":"Figueiredo D. R.","year":"2004","unstructured":"<scp> Figueiredo , D. R. , Nain , P. , and Towsley , D . <\/scp> 2004 . On the analysis of the predecessor attack on anonymous protocols. Tech. rep. 04-65, Department of Computer Science. University of Massachusetts . <scp>Figueiredo, D. R., Nain, P., and Towsley, D.<\/scp> 2004. On the analysis of the predecessor attack on anonymous protocols. Tech. rep. 04-65, Department of Computer Science. University of Massachusetts."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586137"},{"key":"e_1_2_1_23_1","volume-title":"<\/scp>","author":"Goldberg I.","year":"1998","unstructured":"<scp> Goldberg , I. and Wagner , D . <\/scp> 1998 . TAZ servers and the rewebber network: Enabling anonymous publishing on the World Wide Web. &lt;it&gt;First Monday &lt;\/it&gt;. <scp>Goldberg, I. and Wagner, D.<\/scp> 1998. TAZ servers and the rewebber network: Enabling anonymous publishing on the World Wide Web. &lt;it&gt;First Monday&lt;\/it&gt;."},{"key":"e_1_2_1_24_1","volume-title":"<\/scp>","author":"Goldschlag D.","year":"1996","unstructured":"<scp> Goldschlag , D. , Reed , M. , and Syverson , P . <\/scp> 1996 . Hiding routing information. In &lt;it&gt;Proceedings of Information Hiding Workshop (IH '96)&lt;\/it&gt;. 137--150. <scp>Goldschlag, D., Reed, M., and Syverson, P.<\/scp> 1996. Hiding routing information. In &lt;it&gt;Proceedings of Information Hiding Workshop (IH'96)&lt;\/it&gt;. 137--150."},{"key":"e_1_2_1_25_1","unstructured":"<scp>Gribble S.<\/scp> 1997. UC Berkeley home IP HTTP traces. http:\/\/www.acm.org\/sigcomm\/ITA\/.  <scp>Gribble S.<\/scp> 1997. UC Berkeley home IP HTTP traces. http:\/\/www.acm.org\/sigcomm\/ITA\/."},{"key":"e_1_2_1_26_1","first-page":"229","article-title":"Fingerprinting websites using traffic analysis. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. Springer-Verlag","volume":"2482","author":"Hintz A.","year":"2002","unstructured":"<scp> Hintz , A. <\/scp> 2002 . Fingerprinting websites using traffic analysis. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. Springer-Verlag , Lecture Notes in Computer Science , vol. 2482 , 229 -- 233 . <scp>Hintz, A.<\/scp> 2002. Fingerprinting websites using traffic analysis. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. Springer-Verlag, Lecture Notes in Computer Science, vol. 2482, 229--233.","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_1_27_1","unstructured":"Honeynet Project 2005. Know your enemy: Tracking botnets -- spreading. http:\/\/www.honeynet.org\/papers\/bots\/botnet-spreading.html. The Honeynet Project and Research Alliance.  Honeynet Project 2005. Know your enemy: Tracking botnets -- spreading. http:\/\/www.honeynet.org\/papers\/bots\/botnet-spreading.html. The Honeynet Project and Research Alliance."},{"key":"e_1_2_1_28_1","volume-title":"5th International Wkshp (IH'02)","author":"Kesdogan D.","unstructured":"<scp> Kesdogan , D. , Agarwal , D. , and Penz , S . <\/scp> 2002. Limits of anonymity in open environments. In &lt;it&gt;Proceedings of Information Hiding , 5th International Wkshp (IH'02) &lt;\/it&gt;. 53--69. <scp>Kesdogan, D., Agarwal, D., and Penz, S.<\/scp> 2002. Limits of anonymity in open environments. In &lt;it&gt;Proceedings of Information Hiding, 5th International Wkshp (IH'02)&lt;\/it&gt;. 53--69."},{"key":"e_1_2_1_29_1","volume-title":"<\/scp>","author":"Kesdogan D.","year":"1998","unstructured":"<scp> Kesdogan , D. , Egner , J. , and B\u00fcschkes , R . <\/scp> 1998 . Stop-and-go-MIXes providing probabilistic anonymity in an open system. In &lt;it&gt;Information Hiding&lt;\/it&gt;. Lecture Notes in Computer Science, vol. 1525 . Springer , 83--98. <scp>Kesdogan, D., Egner, J., and B\u00fcschkes, R.<\/scp> 1998. Stop-and-go-MIXes providing probabilistic anonymity in an open system. In &lt;it&gt;Information Hiding&lt;\/it&gt;. Lecture Notes in Computer Science, vol. 1525. Springer, 83--98."},{"key":"e_1_2_1_30_1","unstructured":"<scp>K\u00f6psellbibt S.<\/scp> 2003. JAP --- Web mixes. http:\/\/www.petworkshop.org\/2003\/slides\/panels\/stefan-PET2003panel.pdf.  <scp>K\u00f6psellbibt S.<\/scp> 2003. JAP --- Web mixes. http:\/\/www.petworkshop.org\/2003\/slides\/panels\/stefan-PET2003panel.pdf."},{"key":"e_1_2_1_31_1","volume-title":"<\/scp>","author":"Levine B.","year":"2004","unstructured":"<scp> Levine , B. , Reiter , M. , Wang , C. , and Wright , M . <\/scp> 2004 . Timing attacks in low-latency mix systems. In &lt;it&gt;Proceedings of Financial Cryptography (FC'04).&lt;\/it&gt; (Lecture Notes in Computer Science , vol. 3110). 251--- 265 . <scp>Levine, B., Reiter, M., Wang, C., and Wright, M.<\/scp> 2004. Timing attacks in low-latency mix systems. In &lt;it&gt;Proceedings of Financial Cryptography (FC'04).&lt;\/it&gt; (Lecture Notes in Computer Science, vol. 3110). 251---265."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/603404.603406"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180437"},{"key":"e_1_2_1_34_1","volume-title":"<\/scp>","author":"Margolin N. B.","year":"2007","unstructured":"<scp> Margolin , N. B. and Levine , B. N . <\/scp> 2007 . Informant : Detecting sybils using incentives. In &lt;it&gt;Proceedings of Financial Cryptography (FC '07)&lt;\/it&gt;. <scp>Margolin, N. B. and Levine, B. N.<\/scp> 2007. Informant: Detecting sybils using incentives. In &lt;it&gt;Proceedings of Financial Cryptography (FC'07)&lt;\/it&gt;."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11423409_2"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180410"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.12"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.24"},{"key":"e_1_2_1_39_1","volume-title":"Lecture Notes in Computer Science","volume":"2009","author":"Raymond J. F.","year":"2001","unstructured":"<scp> Raymond , J. F. <\/scp> 2001 . Traffic analysis: Protocols, attacks, design issues and open problems. In &lt;it&gt;International Workshop on Design Issues in Anonymity and Unobservability&lt;\/it&gt; . Lecture Notes in Computer Science , vol. 2009 . Springer, 10--29. <scp>Raymond, J. F.<\/scp> 2001. Traffic analysis: Protocols, attacks, design issues and open problems. In &lt;it&gt;International Workshop on Design Issues in Anonymity and Unobservability&lt;\/it&gt;. Lecture Notes in Computer Science, vol. 2009. Springer, 10--29."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"key":"e_1_2_1_41_1","volume-title":"<\/scp>","author":"Rennhard M.","year":"2004","unstructured":"<scp> Rennhard , M. and Plattner , B . <\/scp> 2004 . Practical anonymity for the masses with MorphMix. In &lt;it&gt;Proceedings of Financial Cryptography (FC '04)&lt;\/it&gt;. 233--250. <scp>Rennhard, M. and Plattner, B.<\/scp> 2004. Practical anonymity for the masses with MorphMix. In &lt;it&gt;Proceedings of Financial Cryptography (FC'04)&lt;\/it&gt;. 233--250."},{"key":"e_1_2_1_42_1","volume-title":"<\/scp>","author":"Saroiu S.","year":"2002","unstructured":"<scp> Saroiu , S. , Gummadi , P. K. , and Gribble , S . <\/scp> 2002 . A measurement study of peer-to-peer file sharing systems. In &lt;it&gt;Proceedings of the Multimedia Computing and Networking Conference (MMCN '02)&lt;\/it&gt;. 314--329. <scp>Saroiu, S., Gummadi, P. K., and Gribble, S.<\/scp> 2002. A measurement study of peer-to-peer file sharing systems. In &lt;it&gt;Proceedings of the Multimedia Computing and Networking Conference (MMCN'02)&lt;\/it&gt;. 314--329."},{"key":"e_1_2_1_43_1","volume-title":"<\/scp>","author":"Scarlatta V.","year":"2001","unstructured":"<scp> Scarlatta , V. , Levine , B. , and Shields , C . <\/scp> 2001 . Responder anonymity and anonymous peer-to-peer file sharing. In &lt;it&gt;Proceedings of the IEEE International Conference on Network Protocols (ICNP '01)&lt;\/it&gt;. <scp>Scarlatta, V., Levine, B., and Shields, C.<\/scp> 2001. Responder anonymity and anonymous peer-to-peer file sharing. In &lt;it&gt;Proceedings of the IEEE International Conference on Network Protocols (ICNP'01)&lt;\/it&gt;."},{"key":"e_1_2_1_44_1","first-page":"259","article-title":"Towards an information theoretic metric for anonymity. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;","volume":"2482","author":"Serjantov A.","year":"2002","unstructured":"<scp> Serjantov , A. and Danezis , G. <\/scp> 2002 . Towards an information theoretic metric for anonymity. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt; . Lecture Notes in Computer Science , vol. 2482. 259 -- 263 . <scp>Serjantov, A. and Danezis, G.<\/scp> 2002. Towards an information theoretic metric for anonymity. In &lt;it&gt;Proceedings of the Workshop on Privacy Enhancing Technologies (PET'02)&lt;\/it&gt;. Lecture Notes in Computer Science, vol. 2482. 259--263.","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_1_45_1","volume-title":"<\/scp>","author":"Serjantov A.","year":"2003","unstructured":"<scp> Serjantov , A. and Sewell , P . <\/scp> 2003 . Passive attack analysis for connection-based anonymity systems. In &lt;it&gt;Proceedings of the European Symposium on Research in Computer Security (ESORICS '03)&lt;\/it&gt;. 116--131. <scp>Serjantov, A. and Sewell, P.<\/scp> 2003. Passive attack analysis for connection-based anonymity systems. In &lt;it&gt;Proceedings of the European Symposium on Research in Computer Security (ESORICS'03)&lt;\/it&gt;. 116--131."},{"key":"e_1_2_1_46_1","first-page":"839","article-title":"P5: a protocol for scalable anonymous communication. &lt;it&gt;J","volume":"6","author":"Sherwood R.","year":"2005","unstructured":"<scp> Sherwood , R. , Bhattacharjee , B. , and Srinivasan , A. <\/scp> 2005 . P5: a protocol for scalable anonymous communication. &lt;it&gt;J . Comput. Secur. 13,&lt;\/it&gt; 6 , 839 -- 876 . <scp>Sherwood, R., Bhattacharjee, B., and Srinivasan, A.<\/scp> 2005. P5: a protocol for scalable anonymous communication. &lt;it&gt;J. Comput. Secur. 13,&lt;\/it&gt; 6, 839--876.","journal-title":"Comput. Secur. 13,&lt;\/it&gt;"},{"key":"e_1_2_1_47_1","volume-title":"Probabilistic analysis of anonymity. In &lt;it&gt","author":"Shmatikov V.","unstructured":"<scp> Shmatikov , V. <\/scp> 2002. Probabilistic analysis of anonymity. In &lt;it&gt ; IEEE Computer Security Foundations Workshop &lt;\/it&gt;. 119--128. <scp>Shmatikov, V.<\/scp> 2002. Probabilistic analysis of anonymity. In &lt;it&gt;IEEE Computer Security Foundations Workshop&lt;\/it&gt;. 119--128."},{"key":"e_1_2_1_48_1","volume-title":"<\/scp>","author":"Sun Q.","year":"2002","unstructured":"<scp> Sun , Q. , Simon , D. R. , Wang , Y.-M. , Russell , W. , Padmanabhan , V. N. , and Qiu , L . <\/scp> 2002 . Statistical identification of encrypted Web browsing traffic. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy &lt;\/it&gt;. 19--30. <scp>Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., and Qiu, L.<\/scp> 2002. Statistical identification of encrypted Web browsing traffic. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy&lt;\/it&gt;. 19--30."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/371931.371981"},{"key":"e_1_2_1_50_1","volume-title":"GVU's 10th WWW User Survey","author":"The Graphic","unstructured":"<scp> The Graphic , Visualization, and Usability Center <\/scp>. 1998. GVU's 10th WWW User Survey . http:\/\/www-static.cc.gatech.edu\/user_surveys\/survey-1998-10. <scp>The Graphic, Visualization, and Usability Center<\/scp>. 1998. GVU's 10th WWW User Survey. http:\/\/www-static.cc.gatech.edu\/user_surveys\/survey-1998-10."},{"key":"e_1_2_1_51_1","volume-title":"<\/scp>","author":"Wright M.","year":"2002","unstructured":"<scp> Wright , M. , Adler , M. , Levine , B. N. , and Shields , C . <\/scp> 2002 . An analysis of the degradation of anonymous protocols. In &lt;it&gt;Proceedings of ISOC Network and Distributed System Security Symposium (NDSS '02)&lt;\/it&gt;. 38--50. <scp>Wright, M., Adler, M., Levine, B. N., and Shields, C.<\/scp> 2002. An analysis of the degradation of anonymous protocols. In &lt;it&gt;Proceedings of ISOC Network and Distributed System Security Symposium (NDSS'02)&lt;\/it&gt;. 38--50."},{"key":"e_1_2_1_52_1","volume-title":"<\/scp>","author":"Wright M.","year":"2003","unstructured":"<scp> Wright , M. , Adler , M. , Levine , B. N. , and Shields , C . <\/scp> 2003 . Defending anonymous communication against passive logging attacks. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy &lt;\/it&gt;. 28--41. <scp>Wright, M., Adler, M., Levine, B. N., and Shields, C.<\/scp> 2003. Defending anonymous communication against passive logging attacks. In &lt;it&gt;Proceedings of the IEEE Symposium on Security and Privacy&lt;\/it&gt;. 28--41."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1042031.1042032"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330332.1330335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1330332.1330335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:31Z","timestamp":1750258051000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330332.1330335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1145\/1330332.1330335"],"URL":"https:\/\/doi.org\/10.1145\/1330332.1330335","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]},"assertion":[{"value":"2006-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}