On anonymity in an electronic society: A survey of anonymous communication systems

ACM Computing Surveys

Volumn 42, Issue 1, 2009, Pages

  Edman, Matthew ^a   Yener, Bülent ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

Anonymity; Anonymous communication; DC nets; Mix networks; Mixes; Onion; Privacy; Routing; Traffic analysis

Indexed keywords

ANONYMITY; ANONYMOUS COMMUNICATION; DC-NETS; MIX NETWORKS; MIXES; ONION; PRIVACY; ROUTING; TRAFFIC ANALYSIS;

COMMUNICATION SYSTEMS; CRYPTOGRAPHY; SURVEYS;

INTERNET;

EID: 77955872093     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1592451.1592456     Document Type: Review

References (102)

1. ACQUISTI, A., DINGLEDINE, R., ANDSYVERSON, P. 2003. On the economics of anonymity. In Proceedings of the Financial Cryptography (FC'03), R. N. Wright, Ed. Lecture Notes in Computer Science, vol. 2742. Springer-Verlag, Berlin, Germany.
2. ANDERSON, R. 1996. The eternity service. In Proceedings of Pragocrypt.
3. BACK, A., MÖLLER, U., ANDSTIGLIC, A. 2001. Traffic analysis attacks and trade-offs in anonymity providing systems. In Proceedings of the Information Hiding Workshop (IH'01), I. S. Moskowitz, Ed. Lecture Notes in Computer Science, vol. 2173. Springer-Verlag, Berlin, Germany, 245-257.
4. BEIMEL, A. ANDDOLEV, S. 2003. Buses for anonymous message delivery. J. Cryptol. 16, 1, 25-39.
5. BELLARE, M., BOLDYREVA, A., DESAI, A., ANDPOINTCHEVAL, D. 2001. Key-privacy in public-key encryption. In Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'01). Springer-Verlag, London, U.K., 566-582.
6. BELLARE, M. ANDROGAWAY, P. 1994. Optimal asymmetric encryption-how to encrypt with rsa. In Proceedings of EUROCRYPT.
7. BERTHOLD, O., FEDERRATH, H., ANDKÖPSELL, S. 2000a. Web MIXes: A system for anonymous and unobservable Internet access. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Lecture Notes in Computer Science, vol. 2009. Springer-Verlag, Berlin, Germany, 115-129.
8. BERTHOLD, O. ANDLANGOS, H. 2002. Dummy traffic against long term intersection attacks. In Proceedings of Privacy Enhancing Technologies Workshop (PET'02), R. Dingledine and P. Syverson, Eds. Lecture Notes in Computer Science, vol. 2482. Springer-Verlag, Berlin, Germany.
9. BERTHOLD, O., PFITZMANN, A., ANDSTANDTKE, R. 2000b. The disadvantages of free MIX routes and how to overcome them. In Proceedings of Designing Privacy Enhancing Technologies:Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Lecture Notes in Computer Science, vol. 2009. Springer-Verlag, Berlin, Germany, 30-45.
10. BONEH, D. ANDGOLLE, P. 2002. Almost entirely correct mixing with application to voting. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS), V. Atluri, Ed., 68-77.
11. BORISOV, N., DANEZIS, G.,MITTAL, P., ANDTABRIZ, P. 2007. Denial of service or denial of security? How attacks on reliability can compromise anonymity. In Proceedings of CCS.
12. BOUCHER, P., SHOSTACK, A., ANDGOLDBERG, I. 2000. Freedom systems 2.0 architecture. White paper. Zero Knowledge Systems, Inc. December. Zero Knowledge Systems, Inc., Montreal, P.Q., Canada.
13. BROWN, Z. 2002. Cebolla: Pragmatic IP anonymity. In Proceedings of the Ottawa Linux Symposium.
14. CAMENISCH, J., HOHENBERGER, S., KOHLWEISS, M., LYSYANSKAYA, A., ANDMEYEROVICH, M. 2006. How to win the clonewars: Efficient periodic n-times anonymous authentication. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS). ACM Press, New York, NY, 201-210.
15. CAMENISCH, J.,HOHENBERGER, S., ANDLYSYANSKAYA, A. 2005. Compact e-cash. In Proceedings of EUROCRYPT 2005, R. Cramer, Ed. Lecture Notes in Computer Science, vol. 3494. Springer, Berlin, Germany, 302-321.
16. CAMENISCH, J. ANDLYSYANSKAYA, A. 2001. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'01). Springer-Verlag, London, U.K., 93-118.
17. CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (Feb.), 84-88.
18. CHAUM, D. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol. 1, 65-75.
19. CHOR, B., GOLDREICH, O., KUSHILEVITZ, E., AND SUDAN,M. 1995. Private information retrieval. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 41-50.
20. CITIZEN LAB. 2008. Psiphon. http://psiphon.civisec.org.
21. CLARK, J., VAN OORSCHOT, P. C., ANDADAMS, C. 2007. Usability of anonymousWeb browsing: An examination of Tor interfaces and deployability. In Proceedings of the 3rd Symposium on Usable Privacy and Security (SOUPS). ACM Press, New York, NY, 41-51.
22. CLARKE, I., SANDBERG, O., WILEY, B., AND HONG, T. W. 2000. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Designing Privacy Enhancing Technologies:Workshop on Design Issues in Anonymity and Unobservability. 46-66.
23. CLAYTON, R., DANEZIS, G., ANDKUHN, M. G. 2001. Real world patterns of failure in anonymity systems. In Proceedings of the Information HidingWorkshop (IH'01), I. S.Moskowitz, Ed. Lecture Notes in Computer Science, vol. 2173. Springer-Verlag, Berlin, Germany, 230-244.
24. CLAYTON, R., MURDOCH, S. J., ANDWATSON, R. N. M. 2006. Ignoring the Great Firewall of China. In Proceedings of the sixth Workshop on Privacy Enhancing Technologies (PET'06), G. Danezis and P. Golle, Eds. Springer, Cambridge, U.K., 20-35.
25. CRANDALL, J. R., ZINN, D., BYRD, M., BARR, E., ANDEAST, R. 2007. ConceptDoppler: A weather tracker for internet censorship. In Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS'07). ACM Press, New York, NY, 352-365.
26. DAI, W. 1998. Pipenet 1.0. Post to Cypherpunks mailing list.
27. DANEZIS, G. 2003a. Mix-networks with restricted routes. In Proceedings of Privacy Enhancing Technologies Workshop (PET'03), R. Dingledine, Ed. Lecture Notes in Computer Science, vol. 2760. Springer-Verlag, Berlin, Germany, 1-17.
28. DANEZIS, G. 2003b. Statistical disclosure attacks: Traffic confirmation in open environments. In Proceedings of Security and Privacy in the Age of Uncertainty (SEC'03), G. Gritzalis, Vimercati, Samarati, and Katsikas, Eds. IFIP TC11. Kluwer, Dordrecht, The Netherlands, 421-426.
29. DANEZIS, G. 2004. The traffic analysis of continuous-time mixes. In Proceedings of Privacy Enhancing Technologies Workshop (PET'04). Lecture Notes in Computer Science, vol. 3424. Springer-Verlag, Berlin, Germany, 35-50.
30. DANEZIS, G. ANDCLAYTON, R. 2007. Introducing traffic analysis. In Digital Privacy: Theory, Technologies, and Practices, A. Acquisti, S. Gritzalis, C. Lambrinoudakis, and S. di Vimercati, Eds. Auerbach Publications, Boca Raton, FL, Chapter 5, 95-117.
31. DANEZIS, G., DIAZ, C., ANDTRONCOSO, C. 2007. Two-sided statistical disclosure attack. In Proceedings of the Seventh Workshop on Privacy Enhancing Technologies (PET'07), N. Borisov and P. Golle, Eds. Springer, Ottawa, Canada.
32. DANEZIS, G., DINGLEDINE, R., ANDMATHEWSON, N. 2003. Mixminion: Design of a type III anonymous remailer protocol. In Proceedings of the IEEE Symposium on Security and Privacy.
33. DANEZIS, G. ANDSASSAMAN, L. 2003. Heartbeat traffic to counter (n?1) attacks. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES), Washington, DC.
34. DANEZIS, G. ANDSERJANTOV, A. 2004. Statistical disclosure or intersection attacks on anonymity systems. In Proceedings of the 6th Information Hiding Workshop (IH). 293-308.
35. DIAZ, C. ANDPRENEEL, B. 2004. Taxonomy of mixes and dummy traffic. In Proceedings of I-NetSec04: 3rd Working Conference on Privacy and Anonymity in Networked and Distributed Systems (Toulouse, France).
36. DÍAZ, C. ANDSERJANTOV, A. 2003. Generalising mixes. In Proceedings of Privacy Enhancing Technologies Workshop (PET'03), R. Dingledine, Ed. Lecture Notes in Computer Science, vol. 2760. Springer-Verlag, Berlin, Germany, 18-31.
37. DINGLEDINE, R., FREEDMAN, M. J., ANDMOLNAR, D. 2000. The Free Haven project: Distributed anonymous storage service. In Proceedings of Designing Privacy Enhancing Technologies:Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Lecture Notes in Computer Science, vol. 2009. Springer-Verlag, Berlin, Germany.
38. DINGLEDINE, R. ANDMATHEWSON, N. 2006. Anonymity loves company: Usability and the network effect. In Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS), R. Anderson, Ed.
39. DINGLEDINE, R. ANDMATHEWSON, N. 2007. Tor protocol specification. https://svn.torproject.org/svn/tor/trunk/doc/spec/tor-spec.txt.
40. DINGLEDINE, R., MATHEWSON, N., ANDSYVERSON, P. 2004a. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium.
41. DINGLEDINE, R., MATHEWSON, N., ANDSYVERSON, P. 2005. Challenges in deploying low-latency anonymity. NRL CHACS rep. 5540-625. U.S. Naval Research Laboratory, Washington, DC.
42. DINGLEDINE, R., MATHEWSON, N., ANDSYVERSON, P. 2007. Deploying low-latency anonymity: Design challenges and social factors. IEEE Sec. Priv. 5, 5, 83-87.
43. DINGLEDINE, R., SERJANTOV, A., ANDSYVERSON, P. 2006. Blending different latency traffic with alpha-mixing. In Proceedings of the 6thWorkshop on Privacy Enhancing Technologies (PET'06), G. Danezis and P. Golle, Eds. Springer, Cambridge, U.K., 245-257.
44. DINGLEDINE, R., SHMATIKOV, V., ANDSYVERSON, P. 2004b. Synchronous batching: From cascades to free routes. In Proceedings of the Privacy Enhancing Technologies Workshop (PET'04). Lecture Notes in Computer Science, vol. 3424. Springer-Verlag, Berlin, Germany, 186-206.
45. ELECTRONIC PRIVACY INFORMATION CENTER. 2005. Carnivore. http://epic.org/privacy/carnivore/.
46. FEAMSTER, N. ANDDINGLEDINE, R. 2004. Location diversity in anonymity networks. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES). Washington, DC.
47. FREEDMAN, M. J. ANDMORRIS, R. 2002. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS).
48. GOEL, S., ROBSON, M., POLTE, M., ANDSIRER, E. G. 2003. Herbivore: A Scalable and Efficient Protocol for Anonymous Communication. Tech. rep. 2003-1890. Cornell University, Ithaca, NY. February.
49. GOLDBERG, I. 2000. A pseudonymous communications infrastructure for the internet. Ph.D. dissertation. University, of California, Berkeley, Berkeley, CA.
50. GOLDSCHLAG, D. M., REED, M. G., ANDSYVERSON, P. F. 1996. Hiding routing information. In Proceedings of Information Hiding: First International Workshop, R. Anderson, Ed. Lecture Notes in Computer Science, vol. 1174. Springer-Verlag, Berlin, Germany, 137-150.
51. GOLDWASSER, S. ANDMICALI, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270-299.
52. GOLLE, P. ANDJUELS, A. 2004. Dining cryptographers revisited. In Proceedings of Eurocrypt.
53. GÜLÜ, C. ANDTSUDIK, G. 1996. Mixing E-mail with Babel. In Proceedings of the Network and Distributed Security Symposium (NDSS). IEEE, Los Alamitos, CA, 2-16.
54. HARKAVY, M., TYGAR, J., ANDKIKUCHI, H. 1998. Electronic auctions with private bids. In Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce (WOEC'98). USENIX Association, Berkeley, CA, 61-74.
55. HELMERS, S. 1997. A brief history of anon.penet.fi-the legendary anonymous remailer. http://www.december.com/cmc/mag/1997/sep/helmers.html.
56. HEYDT-BENJAMIN, T. S., SERJANTOV, A., ANDDEFEND, B. 2006. Nonesuch: A mix network with sender unobservability. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES). ACM Press, New York, NY, 1-8.
57. HINTZ, A. 2002. Fingerprinting websites using traffic analysis. In Proceedings of Privacy Enhancing Technologies Workshop (PET'02), R. Dingledine and P. Syverson, Eds. Lecture Notes in Computer Science, vol. 2482. Springer-Verlag, Berlin, Germany.
58. HOPPER, N., VASSERMAN, E. Y., ANDCHAN-TIN, E. 2007. How much anonymity does network latency leak? In Proceedings of CCS.
59. JAKOBSSON, M., JUELS, A., ANDRIVEST, R. L. 2002. Making mix nets robust for electronic voting by randomized partial checking. In Proceedings of the 11th USENIX Security Symposium. JONDOS GMBH. 2008. Jondonym. https://www.jondos.de/ en/.
60. KATE, A., ZAVERUCHA, G., ANDGOLDBERG, I. 2007. Pairing-based onion routing. In Proceedings of the 7th Workshop on Privacy Enhancing Technologies (PET'07), N. Borisov and P. Golle, Eds. Springer, Ottawa, Canada.
61. KESDOGAN, D., AGRAWAL, D., ANDPENZ, S. 2002. Limits of anonymity in open environments. In Proceedings of Information HidingWorkshop (IH'02), F. Petitcolas, Ed. Lecture Notes in Computer Science, vol. 2578. Springer-Verlag, Berlin, Germany.
62. KESDOGAN, D., EGNER, J., ANDBÜSCHKES, R. 1998. Stop-and-go MIXes: Providing probabilistic anonymity in an open system. In Proceedings of Information Hiding Workshop (IH'98). Lecture Notes in Computer Science, vol. 1525. Springer-Verlag, Berlin, Germany.
63. KESDOGAN, D. ANDPIMENIDIS, L. 2004. The hitting set attack on anonymity protocols. In Proceedings of the 6th Information Hiding Workshop (IH). 326-339.
64. KILIAN, J. ANDSAKO, K. 1995. Receipt-free MIX-type voting scheme-a practical solution to the implementation of a voting booth. In Proceedings of EUROCRYPT 1995. Springer-Verlag, Berlin, Germany.
65. KÖPSELL, S. ANDHILLING, U. 2004. How to achieve blocking resistance for existing systems enabling anonymous web surfing. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES).
66. LEVINE, B. N., REITER, M. K., WANG, C., ANDWRIGHT, M. K. 2004. Timing attacks in low-latency mix-based systems. In Proceedings of Financial Cryptography (FC'04), A. Juels, Ed. Lecture Notes in Computer Science, vol. 3110. Springer-Verlag, Berlin, Germany, 251-265.
67. LIBERATORE, M. ANDLEVINE, B. N. 2006. Inferring the source of encrypted HTTP connections. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS). 255-263.
68. MATHEWSON, N. ANDDINGLEDINE, R. 2004. Practical traffic analysis: Extending and resisting statistical disclosure. In Proceedings of Privacy Enhancing Technologies workshop (PET'04). Lecture Notes in Computer Science, vol. 3424. Berlin, Germany, 17-34.
69. MÒLLER, U., COTTRELL, L., PALFRADER, P., ANDSASSAMAN, L. 2003. Mixmaster Protocol-Version 2. IETF Internet draft. www.ietf.org.
70. MURDOCH, S. J. ANDDANEZIS, G. 2005. Low-cost traffic analysis of Tor. In Proceedings of the 2005 IEEE Symposium on Security and Privacy.
71. MURDOCH, S. J. ANDZIELIŃSKI, P. 2007. Sampled traffic analysis by Internet-exchange-level adversaries. In Proceedings of the 7th Workshop on Privacy Enhancing Technologies (PET), N. Borisov and P. Golle, Eds.
72. NAMBIAR, A. ANDWRIGHT, M. 2006. Salsa: A structured approach to large-scale anonymity. In Proceedings of CCS.
73. NEWMAN, R. 1996. The church of scientology vs. anon.penet.fi. http://www.xs4all.nl/∼kspaink/cos/rnewman/anon/penet.html.
74. NEWMAN, R. E., MOSKOWITZ, I. S., SYVERSON, P., ANDSERJANTOV, A. 2003. Metrics for traffic analysis prevention. In Proceedings of Privacy Enhancing Technologies Workshop (PET'03), R. Dingledine, Ed. Lecture Notes in Computer Science, vol. 2760. Springer-Verlag, Berlin, Germany.
75. O'CONNOR, L. 2005. On blending attacks for mixes with memory. In Proceedings of Information Hiding Workshop (IH). 39-52.
76. ØVERLIER, L. AND SYVERSON, P. 2006. Locating hidden servers. In Proceedings of the IEEE Symposium on Security and Privacy.
77. ØVERLIER, L. AND SYVERSON, P. 2007. Improving efficiency and simplicity of Tor circuit establishment and hidden services. In Proceedings of the 7th Workshop on Privacy Enhancing Technologies (PET'07), N. Borisov and P. Golle, Eds. Springer, Ottawa, Canada.
78. PAREKH, S. 1996. Prospects for remailers. First Monday 1, 2 (Aug).
79. PFITZMANN, A. ANDHANSEN, M. 2008. Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft.
80. PFITZMANN, B. ANDPFITZMANN, A. 1990. How to break the direct RSA-implementation of mixes. In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT'89). Springer-Verlag, Berlin, Germany, 373-381.
81. RAO, J. R. ANDROHATGI, P. 2000. Can pseudonymity really guarantee privacy? In Proceedings of the 9th USENIX Security Symposium. USENIX, Berkeley, CA, 85-96.
82. RAYMOND, J.-F. 2000. Traffic analysis: Protocols, attacks, design issues, and open problems. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Lecture Notes in Computer Science, vol. 2009. Springer-Verlag, Berlin, Germany, 10-29.
83. REITER, M. ANDRUBIN, A. 1998. Crowds: Anonymity forWeb transactions. ACM Trans. Inform. Syst. Sec. 1, 1 (Nov.), 66-92.
84. RENNHARD, M. ANDPLATTNER, B. 2002. Introducing MorphMix: Peer-to-peer based anonymous internet usage with collusion detection. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES).
85. RIVEST, R. L., SHAMIR, A., ANDADLEMAN, L. 1983. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26, 1, 96-99.
86. SASSAMAN, L., COHEN, B., ANDMATHEWSON, N. 2005. The Pynchon gate: A secure method of pseudonymous mail retrieval. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES).
87. SERJANTOV, A., DINGLEDINE, R., ANDSYVERSON, P. 2002. From a trickle to a flood: Active attacks on several mix types. In Proceedings of the Information Hiding Workshop (IH'02), F. Petitcolas, Ed. Lecture Notes in Computer Science, vol. 2578. Springer-Verlag, Berlin, Germany.
88. SERJANTOV, A. ANDNEWMAN, R. E. 2003. On the anonymity of timed pool mixes. In Proceedings of the Workshop on Privacy and Anonymity Issues in Networked and Distributed Systems. Kluwer, Athens, Greece, 427-434.
89. SERJANTOV, A. ANDSEWELL, P. 2003. Passive attack analysis for connection-based anonymity systems. In Proceedings of ESORICS.
90. SHERWOOD, R., BHATTACHARJEE, B., ANDSRINIVASAN, A. 2002. P5: A protocol for scalable anonymous communication. In Proceedings of the IEEE Symposium on Security and Privacy.
91. SHMATIKOV, V. ANDWANG, M.-H. 2006. Timing analysis in low-latency mix networks: Attacks and defenses. In Proceedings of ESORICS.
92. SNADER, R. ANDBORISOV, N. 2008. Atune-up for Tor: Improving security and performance in the Tor network. In Proceedings of the Network and Distributed Security Symposium (NDSS). Internet Society, Reston, VA.
93. STEINER, P. 1993. Cartoon. The New Yorker, July 5, page 61.
94. SUN, Q., SIMON, D. R., WANG, Y.-M., RUSSELL, W., PADMANABHAN, V. N., ANDQIU, L. 2002. Statistical identification of encrypted Web browsing traffic. In Proceedings of the IEEE Symposium on Security and Privacy.
95. SYVERSON, P., TSUDIK, G., REED, M., ANDLANDWEHR, C. 2000. Towards an analysis of onion routing security. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, H. Federrath, Ed. Lecture Notes in Computer Science, vol. 2009. Springer-Verlag, Berlin, Germany, 96-114.
96. TABRIZ, P. ANDBORISOV, N. 2006. Breaking the collusion detection mechanism of morphmix. In Proceedings of the 6th Workshop on Privacy Enhancing Technologies (PET'06), G. Danezis and P. Golle, Eds. Springer, Cambridge, U.K., 368-384.
97. WAIDNER, M. ANDPFITZMANN, B. 1990. The dining cryptographers in the disco: Unconditional sender and recipient untraceability. In Proceedings of EUROCRYPT 1989. Lecture Notes in Computer Science, vol. 434. Springer-Verlag, Berlin, Germany.
98. WALDMAN, M. AND MAZIÈRES,D. 2001. Tangler: A censorship-resistant publishing system based on document entanglements. In Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS). 126-135.
99. WALDMAN, M., RUBIN, A., ANDCRANOR, L. 2000. Publius: A robust, tamper-evident, censorship-resistant and source-anonymous Web publishing system. In Proceedings of the 9th USENIX Security Symposium. 59-72.
100. WRIGHT, M., ADLER, M., LEVINE, B. N., ANDSHIELDS, C. 2003. Defending anonymous communication against passive logging attacks. In Proceedings of the IEEE Symposium on Security and Privacy. 28-43.
101. WRIGHT, M., ADLER, M., LEVINE, B. N., ANDSHIELDS, C. 2004. The predecessor attack: An analysis of a threat to anonymous communications systems. ACM Trans. Inform. Syst. Sec. 4, 7 (Nov.), 489-522.
102. ZHU, Y., FU, X., GRAHAM, B., BETTATI, R., ANDZHAO, W. 2004. On flow correlation attacks and countermeasures in mix networks. In Proceedings of Privacy Enhancing Technologies Workshop (PET'04). Lecture Notes in Computer Science, vol. 3424. Berlin, Germany, 207-225.