The predecessor attack: An analysis of a threat to anonymous communications systems

ACM Transactions on Information and System Security

Volumn 7, Issue 4, 2004, Pages 489-522

  Wright, Matthew K ^a,c   Adler, Micah ^a,c   Levine, Brian Neil ^a,c   Shields, Clay ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b GEORGETOWN UNIVERSITY   (United States)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Anonymity; Anonymous communication; Predecessor attack; Privacy

Indexed keywords

ANONYMITY; ANONYMOUS COMMUNICATION; PREDECESSOR ATTACK; PRIVACY;

ACCIDENT PREVENTION; COMPUTER SIMULATION; COSTS; DATA PRIVACY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; TIME DOMAIN ANALYSIS;

COMMUNICATION SYSTEMS;

EID: 14544273666     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042031.1042032     Document Type: Article

References (32)

1. BERTHOLD, O., FEDERRATH, H., AND KOHNTOPP, M. 2000. Project anonymity and unobservability in the internet. In Computers Freedom and Privacy Conference 2000 (CFP 2000) Workshop on Freedom and Privacy by Design.
2. BERTSEKAS, D. AND GALLAGER, R. 1987. Data Networks. Prentice-Hall, Englewood Cliffs, NJ.
3. CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (Feb.), 84-88.
4. CHAUM, D. 1988. The dining cryptographers problem: Unconditional sender and receipient untraceability. J. Cryptography 1, 1, 65-75.
5. FIGUEIREDO, D. R., NAIN, P., AND TOWSLEY, D. 2004. On the analysis of the predecessor attack on anonymous protocols. Technical Report 04-65 (July), University of Massachusetts CMPSCI.
6. FREEDMAN, M. J. AND MORRIS, R. 2002. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of ACM Conference on Computer and Communications Security (CCS 2002).
7. GOLDBERG, I. AND WAGNER, D. 1998. Taz servers and the rewebber network: Enabling anonymous publishing on the world wide web. First Monday.
8. HARMON, A. 1998. Exploration of the world wide web tilts from eclectic to mundane. New York Times (Aug. 26). National Desk.
9. KESDOGAN, D., EGNER, J., AND BUSCHKES, R. 1998. Stop-and-go-mixes providing probabilistic anonymity in an open system. In Information Hiding.
10. KUNG, H. T., BRADNER, S., AND TAN, K.-S. 2002. An ip-layer anonymizing infrastructure. In Proceedings of MILCOM: Military Communications Conference.
11. LEVINE, B. N., REITER, M., WANG, C., AND WRIGHT, M. 2004. Stopping timing attacks in low-latency mix-based systems. In Proceedings of Financial Cryptography.
12. MARTIN, D. 1999. Local Anonymity in the Internet. Ph.D Thesis, Boston, MA.
13. MOTAWANI, R. AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK, chap. 4.
14. PFITZMANN, A., PFITZMANN, B., AND WAIDNER, M. 1991. Isdnmixes: Untraceable communication with very small bandwidth overhead. In GI/ITG Conference: Communication in Distributed Systems.
15. REED, M., SYVERSON, P., AND GOLDSCHLAG, D. 1998. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communication. Special Issue on Copyright and Privacy Protection.
16. REITER, M. K. AND RUBIN, A. D. 1998. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security 1, 1 (Nov.), 66-92.
17. RENNHARD, M. AND PLATTNER, B. 2002. Introducing morphmix: Peer-to-peer based anonymous internet usage with collusion detection. In Proceedings of 2002 ACM Workshop on Privacy in the Electronic Society (WPES).
18. SCARLATTA, V., LEVINE, B., AND SHIELDS, C. 2001. Responder anonymity and anonymous peer-to-peer file sharing. In Proceedings of IEEE International Conference on Network Protocols (ICNP).
19. SCHNEIER, B. 1996. Applied Cryptography. Wiley, New York.
20. SHERWOOD, R., BHATTACHARJEE, B., AND SRINIVASAN, A. 2002. P5: A protocol for scalable anonymous communication. In Proceedings of 2002 IEEE Symposium on Security and Privacy.
21. SHIELDS, C. AND LEVINE, B. 2000. A Protocol for anonymous communication over the internet. In Proceedings of 7th ACM Conference on Computer and Communication Security (ACM CCS 2000).
22. SHMATIKOV, V. 2002. Probabilistic analysis of anonymity. In IEEE Computer Security Foundations Workshop (CSFW). 119-128.
23. STANIFORD-CHEN, S. AND HEBERLEIN, L. 1995. Holding intruders accountable on the internet. In Proceedings of the 1995 IEEE Symposium on Security and Privacy (Oakland, CA). 39-49.
24. SYVERSON, P. AND STUBBLEBINE, S. 1999. Group principals and the formalization of anonymity. In FM'99 - Formal Methods, vol. I, J. Wing, J. Woodcock, and J. Davies, Eds. Lecture Notes in Computer Science, vol. 1708. Springer, Berlin, 814-833.
25. SYVERSON, P., TSUDIK, G., REED, M., AND LANDWEHR, C. 2000. Towards an analysis of onion routing security. In Workshop on Design Issues in Anonymity and Unobservability.
26. WAIDNER, M. AND PFITZMANN, B. 1989a. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Eurocrypt '89.
27. WAIDNER, M. AND PFITZMANN, B. 1989b. Unconditional sender and recipient untraceability in spite of active attacks - Some remarks. Technical Report, Fakultat fur Informatik, Universitat Karlsruhe.
28. WRIGHT, M., ADLER, M., LEVINE, B., AND SHIELDS, C. 2002. An analysis of the degradation of anonymous protocols. In ISOC Symposium on Network and Distributed System Security.
29. WRIGHT, M., ADLER, M., LEVINE, B., AND SHIELDS, C. 2003. Defending anonymous communications against passive logging attacks. In IEEE Symposium on Security and Privacy.
30. XIAO, L., XU, Z., AND ZHANG, X. 2001. Low-cost and reliable mutual anonymity protocols in peer-to-peer networks. Technical Report HPL-2001-204 (Aug.), Hewlett Packard Laboratories.
31. YODA, K. AND ETOH, H. 2000. Finding a connection chain for tracing intruders. In Proceedings of the 6th European Symposium on Research in Computer Security (2000). ESORICS.
32. ZHANG, Y. AND PAXSON, V. 1999. Stepping stone detection. A Presentation at SIGCOMM'99, New Areas of Research.