{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:11:41Z","timestamp":1758845501828},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,14]],"date-time":"2013-12-14T00:00:00Z","timestamp":1386979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00145-013-9171-8","type":"journal-article","created":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T18:12:34Z","timestamp":1386958354000},"page":"623-640","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Provable Unlinkability Against Traffic Analysis with Low Message Overhead"],"prefix":"10.1007","volume":"28","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":"Marcin","family":"Gomu\u0142kiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomer","family":"Levinboim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Ta-Shma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,14]]},"reference":[{"key":"9171_CR1","first-page":"243","volume-title":"S\u00e9minaire de Probabilit\u00e9s de Strasbourg","author":"D.J. Aldous","year":"1983","unstructured":"D.J. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in S\u00e9minaire de Probabilit\u00e9s de Strasbourg, vol.\u00a017, (1983), pp. 243\u2013297"},{"key":"9171_CR2","first-page":"434","volume-title":"FOCS","author":"N. Alon","year":"2001","unstructured":"N. Alon, Testing subgraphs in large graphs, in FOCS, (2001), pp. 434\u2013439"},{"key":"9171_CR3","first-page":"223","volume-title":"FOCS","author":"R. Bubley","year":"1997","unstructured":"R. Bubley, M. Dyer, Path coupling: a\u00a0technique for proving rapid mixing in Markov chains, in FOCS, (1997), pp. 223\u2013231"},{"issue":"1","key":"9171_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"A. Beimel","year":"2003","unstructured":"A. Beimel, S. Dolev, Buses for anonymous message delivery. J. Cryptol.\n                  16(1), 25\u201339 (2003)","journal-title":"J. Cryptol."},{"key":"9171_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-27809-2_26","volume-title":"Financial Cryptography (FC)","author":"R. Berman","year":"2004","unstructured":"R. Berman, A. Fiat, A. Ta-Shma, Provable unlinkability against traffic analysis, in Financial Cryptography (FC). LNCS, vol.\u00a03110, (2004), pp. 266\u2013280"},{"key":"9171_CR6","unstructured":"D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms. Thesis (M.S. in Computer Science), University of California, Berkeley (1979)"},{"issue":"2","key":"9171_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\n                  24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"9171_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, The Dining Cryptographers Problem: unconditional sender and recipient untraceability. J.\u00a0Cryptol.\n                  1(1), 65\u201375 (1988)","journal-title":"J.\u00a0Cryptol."},{"issue":"3\u20134","key":"9171_CR9","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<238::AID-RSA4>3.0.CO;2-E","volume":"17","author":"A. Czumaj","year":"2000","unstructured":"A. Czumaj, M. Kuty\u0142owski, Delayed path coupling and generating random permutations. Random Struct. Algorithms\n                  17(3\u20134), 238\u2013259 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"9171_CR10","first-page":"271","volume-title":"SODA","author":"A. Czumaj","year":"1999","unstructured":"A. Czumaj, P. Kanarek, M. Kuty\u0142owski, K. Lory\u015b, Delayed path coupling and generating random permutations via distributed stochastic processes, in SODA, (1999), pp. 271\u2013280"},{"key":"9171_CR11","series-title":"LNCS","first-page":"169","volume-title":"CRYPTO","author":"J. Camenisch","year":"2005","unstructured":"J. Camenisch, A. Lysyanskaya, A formal treatment of onion routing, in CRYPTO. LNCS, vol.\u00a03621, (2005), pp. 169\u2013187"},{"key":"9171_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"T.M. Cover, J.A. Thomas, Elements of Information Theory (Wiley, New York, 1991)"},{"key":"9171_CR13","first-page":"421","volume-title":"Security and Privacy (SEC)","author":"G. Danezis","year":"2003","unstructured":"G. Danezis, Statistical disclosure attacks: traffic confirmation in open environments, in Security and Privacy (SEC), (2003), pp. 421\u2013426"},{"key":"9171_CR14","unstructured":"G. Danezis, C. Diaz, A survey of anonymous communication channels. Microsoft Technical report MSR-TR-2008-35. Available at: \n                    http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=70553"},{"key":"9171_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-30144-8_30","volume-title":"International Workshop on Information Security","author":"M. Gomu\u0142kiewicz","year":"2004","unstructured":"M. Gomu\u0142kiewicz, M. Klonowski, M. Kuty\u0142owski, Provable unlinkability against traffic analysis already after O(log(n)) steps! in International Workshop on Information Security. LNCS, vol.\u00a03225, (2004), pp.\u00a0354\u2013366"},{"key":"9171_CR16","series-title":"LNCS","first-page":"475","volume-title":"European Symposium on Research in Computer Security (ESORICS)","author":"M. Gogolewski","year":"2005","unstructured":"M. Gogolewski, M. Klonowski, M. Kuty\u0142owski, Local view attack on anonymous communication, in European Symposium on Research in Computer Security (ESORICS). LNCS, vol.\u00a03679, (2005), pp.\u00a0475\u2013488"},{"key":"9171_CR17","series-title":"LNCS","first-page":"380","volume-title":"Information Security and Cryptology (ICISC)","author":"M. Gogolewski","year":"2004","unstructured":"M. Gogolewski, M. Kuty\u0142owski, T. \u0141uczak, Mobile mixing, in Information Security and Cryptology (ICISC). LNCS, vol.\u00a03506, (2004), pp. 380\u2013393"},{"key":"9171_CR18","unstructured":"V. Guruswami, Rapidly mixing Markov chains: a comparison of techniques (2000)"},{"key":"9171_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511613586","volume-title":"Finite Markov Chains and Algorithmic Applications","author":"O. H\u00e4ggstr\u00f6m","year":"2002","unstructured":"O. H\u00e4ggstr\u00f6m, Finite Markov Chains and Algorithmic Applications, vol.\u00a052 (Cambridge University Press, Cambridge, 2002)"},{"key":"9171_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-46088-8_12","volume-title":"Financial Cryptography (FC)","author":"D. Malkhi","year":"2001","unstructured":"D. Malkhi, E. Pavlov, Anonymity without \u2018cryptography\u2019 (extended abstract), in Financial Cryptography (FC). LNCS, vol.\u00a02339, (2001), pp. 117\u2013135"},{"key":"9171_CR21","volume-title":"Quantum Computation and Quantum Information","author":"M. Nielsen","year":"2000","unstructured":"M. Nielsen, I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)"},{"key":"9171_CR22","series-title":"LNCS","first-page":"373","volume-title":"Eurocrypt","author":"B. Pfitzmann","year":"1989","unstructured":"B. Pfitzmann, A. Pfitzmann, How to break the direct RSA-implementation of MIXes, in Eurocrypt. LNCS, vol.\u00a0434 (Springer, Berlin, 1989), pp. 373\u2013381"},{"key":"9171_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44702-4_2","volume-title":"Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability","author":"J. Raymond","year":"2001","unstructured":"J. Raymond, Traffic analysis: protocols, attacks, design issues, and open problems, in Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, ed. by H.\u00a0Federrath. LNCS, vol.\u00a02009, (2001), pp.\u00a010\u201329"},{"issue":"1","key":"9171_CR24","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"M.K. Reiter, A.D. Rubin, Crowds: anonymity for Web transactions. ACM Trans. Inf. Syst. Secur.\n                  1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"9171_CR25","first-page":"672","volume-title":"STOC","author":"C. Rackoff","year":"1993","unstructured":"C. Rackoff, D.R. Simon, Cryptographic defense against traffic analysis, in STOC, (1993), pp. 672\u2013681"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9171-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9171-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9171-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9171-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:15:55Z","timestamp":1586333755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9171-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,14]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9171-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,14]]},"assertion":[{"value":"28 July 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}