{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:37:04Z","timestamp":1773254224539,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540427339","type":"print"},{"value":"9783540454960","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45496-9_18","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:08:40Z","timestamp":1178370520000},"page":"245-257","source":"Crossref","is-referenced-by-count":123,"title":["Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems"],"prefix":"10.1007","author":[{"given":"Adam","family":"Back","sequence":"first","affiliation":[]},{"given":"Ulf","family":"M\u00f6ller","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Stiglic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"18_CR1","unstructured":"Anonymizer.com. The anonymizer."},{"key":"18_CR2","unstructured":"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\u201326 July 2000), ICSI TR-00-011, pp. 27\u201342."},{"key":"18_CR3","unstructured":"Bos, J., AND Boer, B. D. Detection of disrupters in the DC protocol. In Advances in Cryptology-EURO CRYPT\u2019 89 (1989), pp. 320\u2013327."},{"key":"18_CR4","unstructured":"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."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cuphaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the Association for Computing Machinery 24,2 (Feb. 1981), 84\u201388.","DOI":"10.1145\/358549.358563"},{"issue":"1","key":"18_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"7","author":"D. Chaum","year":"1988","unstructured":"Chaum, D. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology 7,1 (1988), 65\u201375.","journal-title":"Journal of Cryptology"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology\u2014 EUROCRYPT99","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., AND Rabin, T. Efficient multiparty computations with dishonest minority. In Advances in Cryptology\u2014 EUROCRYPT99 (March 1999), vol. 1561 of Lecture Notes in Computer Science, Springer-Verlag, pp. 311\u2013326."},{"key":"18_CR8","unstructured":"Dai, W. Pipenet 1.1. http:\/\/www.eskimo.com\/weidai\/pipenet.txt , 1998."},{"key":"18_CR9","unstructured":"Dai, W. Two attacks against freedom. http:\/\/www.eskimo.coni\/~weidai\/freedom-attacks.txt , 2000."},{"key":"18_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 2000","author":"Y. Desmedt","year":"2000","unstructured":"Desmedt, Y., AND Kurosawa, K. How to break a practical mix and design a new one. In Advances in Cryptology-EUROCRYPT\u2019 2000 (2000), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Heidelberg, pp. 557\u2013572."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/277697.277716"},{"key":"18_CR12","unstructured":"Goldberg, I., AND Shostack, A. Freedom network 1.0 architecture and protocols. http:\/\/www.freedom.net\/info\/freedompapers\/index.html , 1999."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., AND Wigderson, A. How to play any mental game \u2014 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\u201327, 1987 (New York, NY 10036, USA, 1987), ACM, Ed., ACM Press, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"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\u201341.","DOI":"10.1145\/293411.293443"},{"key":"18_CR15","unstructured":"Green, L. Traffic shaping argument. Article on cypherpunks list, 1993."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Jakobsson. Flash mixing. In PODC: 18th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (1999).","DOI":"10.1145\/301308.301333"},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"A practical mix","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M. A practical mix. Lecture Notes in Computer Science 1403 (1998), 448"},{"key":"18_CR18","unstructured":"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."},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"In Advances in Cryptology-CRYPTO\u2019 96 (1996)","author":"P. C. Kocher","year":"1996","unstructured":"Kocher, P. C. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Advances in Cryptology-CRYPTO\u2019 96 (1996), N. Koblitz, Ed., Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, pp. 104\u2013113."},{"key":"18_CR20","series-title":"The CRC Press series on discrete mathematics and its applications","volume-title":"Handbook of applied cryptography","author":"A. J. Menezes","year":"1997","unstructured":"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."},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-44448-3_14","volume-title":"In Advances in Cryptology-ASIACRYPT\u2019 2000","author":"M. Ohkubo","year":"2000","unstructured":"Ohkubo, M., AND Abe, M. A length-invariant hybrid mix. In Advances in Cryptology-ASIACRYPT\u2019 2000 (2000), Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Heidelberg, pp. 178\u2013191."},{"key":"18_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Efficient anonymous channel and all\/nothing election scheme","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., AND Kurosawa, K. Efficient anonymous channel and all\/nothing election scheme. Lecture Notes in Computer Science 765 (1994)"},{"key":"18_CR23","unstructured":"Pfitzmann, A., Pfitzmann, B., AND Waidner, M. ISDN-MIXes: untraceable communication with very small bandwidth overhead. In Information Security, Proc. IFIP\/Sec\u2019 91 (1991), pp. 245\u2013258."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"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\u201318 May 1993), pp. 672\u2013681.","DOI":"10.1145\/167088.167260"},{"key":"18_CR25","unstructured":"Raymond, J.-F. Traffic analysis: Protocols, attacks, design issues and open problems. In Proc. Workshop on Design Issues in Anonymity and Unobservability (25\u201326 July 2000), ICSITR-00-011,pp. 7\u201326."},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Reiter, M. K., AND Rubin, A. D. Anonymous Web transactions with crowds. Communications of the ACM 42,2 (Feb. 1999), 32\u201348.","DOI":"10.1145\/293411.293778"},{"key":"18_CR27","volume-title":"Cryptology SOCS-98.2","author":"A. Smith","year":"1998","unstructured":"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."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"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\u201326 July 2000), ICSI RR-00-011, pp. 83\u2013100.","DOI":"10.21236\/ADA465255"},{"key":"18_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-46885-4_32","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 89","author":"M. Waidner","year":"1990","unstructured":"Waidner, M. Unconditional sender and recipient untraceability in spite of active attacks. In Advances in Cryptology-EUROCRYPT\u2019 89 (1990), J.-J. Quisquater and J. Vandewalle, Eds., Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, pp. 302\u2013319."},{"key":"18_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1007\/3-540-46885-4_69","volume-title":"In Advances in Cryptology\u2014EUROCRYPT89","author":"M. Waidner","year":"1990","unstructured":"Waidner, M., AND Pfitzmann, B. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Advances in Cryptology\u2014EUROCRYPT89 (10\u201313 Apr. 1989), J.-J. Quisquater and J. Vandewalle, Eds., vol. 434 of Lecture Notes in Computer Science, Springer-Verlag, 1990, p. 690."}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45496-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:14:49Z","timestamp":1736993689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45496-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427339","9783540454960"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45496-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}