skip to main content
research-article

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

Published: 14 December 2009 Publication History

Abstract

The past two decades have seen a growing interest in methods for anonymous communication on the Internet, both from the academic community and the general public. Several system designs have been proposed in the literature, of which a number have been implemented and are used by diverse groups, such as journalists, human rights workers, the military, and ordinary citizens, to protect their identities on the Internet.
In this work, we survey the previous research done to design, develop, and deploy systems for enabling private and anonymous communication on the Internet. We identify and describe the major concepts and technologies in the field, including mixes and mix networks, onion routing, and Dining Cryptographers networks. We will also review powerful traffic analysis attacks that have motivated improvements and variations on many of these anonymity protocols made since their introduction. Finally, we will summarize some of the major open problems in anonymous communication research and discuss possible directions for future work in the field.

References

[1]
Acquisti, A., Dingledine, R., and Syverson, 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., and Stiglic, 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. and Dolev, S. 2003. Buses for anonymous message delivery. J. Cryptol. 16, 1, 25--39.
[5]
Bellare, M., Boldyreva, A., Desai, A., and Pointcheval, 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. and Rogaway, P. 1994. Optimal asymmetric encryption—how to encrypt with rsa. In Proceedings of EUROCRYPT.
[7]
Berthold, O., Federrath, H., and Kö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. and Langos, 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., and Standtke, 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. and Golle, 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., and Tabriz, 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., and Goldberg, 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., and Meyerovich, 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., and Lysyanskaya, 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. and Lysyanskaya, 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., and Adams, C. 2007. Usability of anonymous Web 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., and Kuhn, M. G. 2001. Real world patterns of failure in anonymity 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, 230--244.
[24]
Clayton, R., Murdoch, S. J., and Watson, 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., and East, 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. and Clayton, 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., and Troncoso, 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., and Mathewson, N. 2003. Mixminion: Design of a type III anonymous remailer protocol. In Proceedings of the IEEE Symposium on Security and Privacy.
[33]
Danezis, G. and Sassaman, 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. and Serjantov, A. 2004. Statistical disclosure or intersection attacks on anonymity systems. In Proceedings of the 6th Information Hiding Workshop (IH). 293--308.
[35]
Diaz, C. and Preneel, 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. and Serjantov, 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., and Molnar, 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. and Mathewson, 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. and Mathewson, N. 2007. Tor protocol specification. https://svn.torproject.org/svn/tor/trunk/doc/spec/tor-spec.txt.
[40]
Dingledine, R., Mathewson, N., and Syverson, P. 2004a. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium.
[41]
Dingledine, R., Mathewson, N., and Syverson, 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., and Syverson, P. 2007. Deploying low-latency anonymity: Design challenges and social factors. IEEE Sec. Priv. 5, 5, 83--87.
[43]
Dingledine, R., Serjantov, A., and Syverson, P. 2006. Blending different latency traffic with alpha-mixing. In Proceedings of the 6th Workshop on Privacy Enhancing Technologies (PET'06), G. Danezis and P. Golle, Eds. Springer, Cambridge, U.K., 245--257.
[44]
Dingledine, R., Shmatikov, V., and Syverson, 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. and Dingledine, 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. and Morris, 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., and Sirer, 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., and Syverson, 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. and Micali, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270--299.
[52]
Golle, P. and Juels, A. 2004. Dining cryptographers revisited. In Proceedings of Eurocrypt.
[53]
Gülcü, C. and Tsudik, 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., and Kikuchi, 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., and Defend, 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., and Chan-Tin, E. 2007. How much anonymity does network latency leak? In Proceedings of CCS.
[59]
Jakobsson, M., Juels, A., and Rivest, R. L. 2002. Making mix nets robust for electronic voting by randomized partial checking. In Proceedings of the 11th USENIX Security Symposium.
[60]
JonDos GmbH. 2008. Jondonym. https://www.jondos.de/en/.
[61]
Kate, A., Zaverucha, G., and Goldberg, 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.
[62]
Kesdogan, D., Agrawal, D., and Penz, S. 2002. Limits of anonymity in open environments. In Proceedings of Information Hiding Workshop (IH'02), F. Petitcolas, Ed. Lecture Notes in Computer Science, vol. 2578. Springer-Verlag, Berlin, Germany.
[63]
Kesdogan, D., Egner, J., and Bü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.
[64]
Kesdogan, D. and Pimenidis, L. 2004. The hitting set attack on anonymity protocols. In Proceedings of the 6th Information Hiding Workshop (IH). 326--339.
[65]
Kilian, J. and Sako, 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.
[66]
Köpsell, S. and Hilling, 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).
[67]
Levine, B. N., Reiter, M. K., Wang, C., and Wright, 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.
[68]
Liberatore, M. and Levine, 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.
[69]
Mathewson, N. and Dingledine, 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.
[70]
Möller, U., Cottrell, L., Palfrader, P., and Sassaman, L. 2003. Mixmaster Protocol—Version 2. IETF Internet draft. www.ietf.org.
[71]
Murdoch, S. J. and Danezis, G. 2005. Low-cost traffic analysis of Tor. In Proceedings of the 2005 IEEE Symposium on Security and Privacy.
[72]
Murdoch, S. J. and Zieliń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.
[73]
Nambiar, A. and Wright, M. 2006. Salsa: A structured approach to large-scale anonymity. In Proceedings of CCS.
[74]
Newman, R. 1996. The church of scientology vs. anon.penet.fi. http://www.xs4all.nl/~kspaink/cos/rnewman/anon/penet.html.
[75]
Newman, R. E., Moskowitz, I. S., Syverson, P., and Serjantov, 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.
[76]
O'Connor, L. 2005. On blending attacks for mixes with memory. In Proceedings of Information Hiding Workshop (IH). 39--52.
[77]
Øverlier, L. and Syverson, P. 2006. Locating hidden servers. In Proceedings of the IEEE Symposium on Security and Privacy.
[78]
Ø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.
[79]
Parekh, S. 1996. Prospects for remailers. First Monday 1, 2 (Aug).
[80]
Pfitzmann, A. and Hansen, M. 2008. Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft.
[81]
Pfitzmann, B. and Pfitzmann, 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.
[82]
Rao, J. R. and Rohatgi, P. 2000. Can pseudonymity really guarantee privacy? In Proceedings of the 9th USENIX Security Symposium. USENIX, Berkeley, CA, 85--96.
[83]
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.
[84]
Reiter, M. and Rubin, A. 1998. Crowds: Anonymity for Web transactions. ACM Trans. Inform. Syst. Sec. 1, 1 (Nov.), 66--92.
[85]
Rennhard, M. and Plattner, 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).
[86]
Rivest, R. L., Shamir, A., and Adleman, L. 1983. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26, 1, 96--99.
[87]
Sassaman, L., Cohen, B., and Mathewson, N. 2005. The Pynchon gate: A secure method of pseudonymous mail retrieval. In Proceedings of the Workshop on Privacy in the Electronic Society (WPES).
[88]
Serjantov, A., Dingledine, R., and Syverson, 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.
[89]
Serjantov, A. and Newman, 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.
[90]
Serjantov, A. and Sewell, P. 2003. Passive attack analysis for connection-based anonymity systems. In Proceedings of ESORICS.
[91]
Sherwood, R., Bhattacharjee, B., and Srinivasan, A. 2002. P5: A protocol for scalable anonymous communication. In Proceedings of the IEEE Symposium on Security and Privacy.
[92]
Shmatikov, V. and Wang, M.-H. 2006. Timing analysis in low-latency mix networks: Attacks and defenses. In Proceedings of ESORICS.
[93]
Snader, R. and Borisov, N. 2008. A tune-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.
[94]
Steiner, P. 1993. Cartoon. The New Yorker, July 5, page 61.
[95]
Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., and Qiu, L. 2002. Statistical identification of encrypted Web browsing traffic. In Proceedings of the IEEE Symposium on Security and Privacy.
[96]
Syverson, P., Tsudik, G., Reed, M., and Landwehr, 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.
[97]
Tabriz, P. and Borisov, 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.
[98]
Waidner, M. and Pfitzmann, 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.
[99]
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.
[100]
Waldman, M., Rubin, A., and Cranor, 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.
[101]
Wright, M., Adler, M., Levine, B. N., and Shields, C. 2003. Defending anonymous communication against passive logging attacks. In Proceedings of the IEEE Symposium on Security and Privacy. 28--43.
[102]
Wright, M., Adler, M., Levine, B. N., and Shields, C. 2004. The predecessor attack: An analysis of a threat to anonymous communications systems. ACM Trans. Inform. Syst. Sec. 4, 7 (Nov.), 489--522.
[103]
Zhu, Y., Fu, X., Graham, B., Bettati, R., and Zhao, 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.

Cited By

View all
  • (2024)Let the Users Choose: Low Latency or Strong Anonymity? Investigating Mix Nodes with Paired Mixing TechniquesProceedings of the 19th International Conference on Availability, Reliability and Security10.1145/3664476.3664516(1-11)Online publication date: 30-Jul-2024
  • (2024)Detecting Corruptive Noise Rounds for Statistical Disclosure Attacks2024 9th International Conference on Computer Science and Engineering (UBMK)10.1109/UBMK63289.2024.10773533(766-771)Online publication date: 26-Oct-2024
  • (2024)On Combinatorial Security Testing for the Tor Anonymity Network Client2024 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW60967.2024.00047(207-210)Online publication date: 27-May-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys
ACM Computing Surveys  Volume 42, Issue 1
December 2009
162 pages
ISSN:0360-0300
EISSN:1557-7341
DOI:10.1145/1592451
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 December 2009
Accepted: 01 September 2008
Revised: 01 June 2008
Received: 01 January 2008
Published in CSUR Volume 42, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Anonymity
  2. DC-nets
  3. anonymous communication
  4. mix networks
  5. mixes
  6. onion routing
  7. privacy
  8. traffic analysis

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)188
  • Downloads (Last 6 weeks)8
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Let the Users Choose: Low Latency or Strong Anonymity? Investigating Mix Nodes with Paired Mixing TechniquesProceedings of the 19th International Conference on Availability, Reliability and Security10.1145/3664476.3664516(1-11)Online publication date: 30-Jul-2024
  • (2024)Detecting Corruptive Noise Rounds for Statistical Disclosure Attacks2024 9th International Conference on Computer Science and Engineering (UBMK)10.1109/UBMK63289.2024.10773533(766-771)Online publication date: 26-Oct-2024
  • (2024)On Combinatorial Security Testing for the Tor Anonymity Network Client2024 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW60967.2024.00047(207-210)Online publication date: 27-May-2024
  • (2024)Activity-based payments: alternative (anonymous) online payment modelInternational Journal of Information Security10.1007/s10207-024-00816-023:3(1741-1759)Online publication date: 1-Jun-2024
  • (2024)Distributed Dynamic Self-control Anonymity Management ModelSecurity and Trust Management10.1007/978-3-031-76371-7_2(21-35)Online publication date: 21-Dec-2024
  • (2023)Enhancing the Unlinkability of Circuit-Based Anonymous Communications with k-FunnelsProceedings of the ACM on Networking10.1145/36291401:CoNEXT3(1-26)Online publication date: 28-Nov-2023
  • (2023)Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and ProtectionACM SIGMETRICS Performance Evaluation Review10.1145/3606376.359352551:1(89-90)Online publication date: 27-Jun-2023
  • (2023)Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and ProtectionProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35793357:1(1-41)Online publication date: 2-Mar-2023
  • (2023)Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and ProtectionAbstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems10.1145/3578338.3593525(89-90)Online publication date: 19-Jun-2023
  • (2023)Malicious Relay Detection for Tor Network Using Hybrid Multi-Scale CNN-LSTM with Attention2023 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC58397.2023.10217886(1242-1247)Online publication date: 9-Jul-2023
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media