{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:23:36Z","timestamp":1763619816436},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540224204"},{"type":"electronic","value":"9783540278092"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27809-2_26","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T23:28:35Z","timestamp":1283815715000},"page":"266-280","source":"Crossref","is-referenced-by-count":23,"title":["Provable Unlinkability against Traffic Analysis"],"prefix":"10.1007","author":[{"given":"Ron","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Ta-Shma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Thesis (M.S. In: Computer Science), University of California, Berkeley, Berkeley, CA, USA (1979)","key":"26_CR1"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the Association for Computing Machinery\u00a024, 84\u201388 (1981)","journal-title":"Communications of the Association for Computing Machinery"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"M.G. Reed","year":"1998","unstructured":"Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications\u00a016, 482\u2013494 (1998)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"doi-asserted-by":"crossref","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: IEEE Symposium on Security and Privacy, pp. 44\u201354 (1997)","key":"26_CR4","DOI":"10.1109\/SECPRI.1997.601314"},{"doi-asserted-by":"crossref","unstructured":"Rackoff, C., 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, pp. 672\u2013681 (1993)","key":"26_CR5","DOI":"10.1145\/167088.167260"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security\u00a01, 66\u201392 (1998)","journal-title":"ACM Transactions on Information and System Security"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"Public Key Cryptography","author":"M. Abe","year":"2001","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 317\u2013324. Springer, Heidelberg (2001)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-36108-1","volume-title":"Financial Cryptography","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Pavlov, E.: Anonymity without \u2018cryptography\u2019 (extended abstract). In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, p. 108. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Beimel, Dolev: Buses for anonymous message delivery. JCRYPTOL: Journal of Cryptology\u00a016 (2003)","key":"26_CR11","DOI":"10.1007\/s00145-002-0128-6"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44702-4_2","volume-title":"Designing Privacy Enhancing Technologies","author":"J.F. Raymond","year":"2001","unstructured":"Raymond, J.F.: Traffic analysis: Protocols, attacks, design issues, and open problems. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 10\u201329. Springer, Heidelberg (2001)"},{"unstructured":"The anonymizer, http:\/\/anonymizer.com","key":"26_CR13"},{"unstructured":"Anonymous remailer information, http:\/\/anon.efga.org\/Remailers","key":"26_CR14"},{"doi-asserted-by":"crossref","unstructured":"Federrath, H. (ed.) Designing Privacy Enhancing Technologies, InternationalWorkshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA (July 25-26, 2000), Proceedings. In Federrath, H., ed.: International Workshop on Design Issues in Anonymity and Unobservability. Volume 2009 of Lecture Notes in Computer Science., Springer (2001)","key":"26_CR15","DOI":"10.1007\/3-540-44702-4"},{"doi-asserted-by":"crossref","unstructured":"Alon, N.: Testing subgraphs in large graphs. In: 42nd IEEE Symposium on Foundations of Computer Science, pp. 434\u2013439 (2001)","key":"26_CR16","DOI":"10.1109\/SFCS.2001.959918"},{"key":"26_CR17","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York (1991)"},{"unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information, Cambridge (2000)","key":"26_CR18"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27809-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:36Z","timestamp":1605741696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27809-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540224204","9783540278092"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27809-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}