Traffic analysis attacks and trade-offs in anonymity providing systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2137, Issue , 2001, Pages 245-257

  Back, Adam ^a   Möller, Ulf ^a   Stiglic, Anton ^a  

^a Zero Knowledge Systems Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; DENIAL-OF-SERVICE ATTACK; TELECOMMUNICATION NETWORKS; TRANSMISSION CONTROL PROTOCOL;

DENIAL-OF-SERVICES ATTACK; LOW LATENCY; LOW-LATENCY COMMUNICATION; THEORETICAL MODELING; TRADE OFF; TRAFFIC ANALYSIS ATTACKS;

ECONOMIC AND SOCIAL EFFECTS;

EID: 84947242344     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45496-9_18     Document Type: Article

References (30)

1. Anonymizer.com. The anonymizer.
2. Berthold, O., Pfitzmann, A., and Standtke, R. The disadvantages of free mix routes and how to overcome them. In Proc. Workshop on Design Issues in Anonymity and Unobservability (25-26 July 2000), ICSI TR-00-011, pp. 27-42.
3. Bos, J., and Boer, B. D. Detection of disrupters in the DC protocol. In Advances in Cryptology - EURO CRYPT '89 (1989), pp. 320-327.
4. Canetti, R. Studies in Secure Multiparty Computation and Applications. PhD thesis, Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, June 1995. revised version.
5. Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the Association for Computing Machinery 24, 2 (Feb. 1981), 84-88.
6. Chaum, D. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology 7, 1 (1988), 65-75.
7. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., and Rabin, T. Efficient multiparty computations with dishonest minority. In Advances in Cryptology-EUROCRYPT99 (March 1999), vol. 1561 of Lecture Notes in Computer Science, Springer-Verlag, pp. 311-326.
8. Dai, W. Pipenet 1.1. http://www.eskimo.com/~weidai/pipenet.txt, 1998.
9. Dai, W. Two attacks against freedom. http://www.eskimo.com/~weidai/freedom-attacks.txt, 2000.
10. Desmedt, Y., and Kurosawa, K. How to break a practical mix and design a new one. In Advances in Cryptology - EUROCRYPT '2000 (2000), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Heidelberg, pp. 557-572.
11. Gennaro, R., Rabin, M. O., and Rabin, T. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In PODC: 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (1998).
12. Goldberg, I., and Shostack, A. Freedom network 1.0 architecture and protocols. htt://www.freedom.net/info/freedompapers/index.html, 1999.
13. Goldreich, O., Micali, S., and Wigderson, A. How to play any mental game - A completeness theorem for protocols with honest majority. In Proceedings of the nineteenth annual ACM Symposium on Theory of Computing, New York City, May 25-27, 1987 (New York, NY 10036, USA, 1987), ACM, Ed., ACM Press, pp. 218-229.
14. Goldschlag, D., Reed, M., and Syverson, P. Onion routing for anonymous and private internet connections. Communications of the ACM (USA) 42, 2 (Feb. 1999), 39-41.
15. Green, L. Traffic shaping argument. Article on cypherpunks list, 1993.
16. Jakobsson. Flash mixing. In PODC: 18th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (1999).
17. Jakobsson, M. A practical mix. Lecture Notes in Computer Science 1403 (1998)
18. Jakobsson, M., and Juels, A. Millimix: Mixing in small batches. Tech. Rep. 99-33, DIMACS, June 10 1999. Thu, 22 Jul 1999 23: 50: 00 GMT.
19. Kocher, P. C. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Advances in Cryptology - CRYPTO’ 96 (1996), N. Koblitz, Ed., Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, pp. 104-113.
20. Menezes, A. J., Van Oorschot, P. C., and Vanstone, S. A. Handbook of applied cryptography. The CRC Press series on discrete mathematics and its applications. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1997.
21. Ohkubo, M., and Abe, M. A length-invariant hybrid mix. In Advances in Cryptology -ASIACRYPT '2000 (2000), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Heidelberg, pp. 178-191.
22. Park, C., Itoh, K., and Kurosawa, K. Efficient anonymous channel and all/nothing election scheme. Lecture Notes in Computer Science 765 (1994)
23. Pfitzmann, A., Pfitzmann, B., and waidner, M. ISDN-MIXes: untraceable communication with very small bandwidth overhead. In Information Security, Proc. IFIP/Sec '91 (1991), pp. 245-258.
24. Rackoff, C., and Simon, D. R. Cryptographic defense against traffic analysis. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing (San Diego, California, 16-18 May 1993), pp. 672-681.
25. Raymond, J.-F. Traffic analysis: Protocols, attacks, design issues and open problems. In Proc. Workshop on Design Issues in Anonymity and Unobservability (25-26 July 2000), ICSITR-00-011, pp. 7-26.
26. Reiter, M. K., and Rubin, A. D. Anonymous Web transactions with crowds. Communications of the ACM 42, 2 (Feb. 1999), 32-48.
27. Smith, A., and Stiglic, A. Multiparty computation unconditionally secure against II2 adversary structures. Cryptology SOCS-98.2, School of Computer Science, McGill University, Montreal, Canada, 1998.
28. Syverson, P. F., Tsudik, G., Reed, M. G., and Landwehr, C. E. Towards an analysis of onion routing security. In Proc. Workshop on Design Issues in Anonymity and Unobservability (25-26 July 2000), ICSI RR-00-011, pp. 83-100. 248, 252
29. Waidner, M. Unconditional sender and recipient untraceability in spite of active attacks. In Advances in Cryptology - EUROCRYPT’ 89 (1990), J.-J. Quisquater and J. Vande-walle, Eds., Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, pp. 302-319.
30. Waidner, M., and Pfitzmann, B. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Advances in Cryptology-EUROCRYPT89 (10-13 Apr. 1989), J.-J. Quisquater and J. Vandewalle, Eds., vol. 434 of Lecture Notes in Computer Science, Springer-Verlag, 1990, p. 690.