{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:48Z","timestamp":1725566208678},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232087"},{"type":"electronic","value":"9783540301448"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30144-8_30","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T00:34:45Z","timestamp":1284856485000},"page":"354-366","source":"Crossref","is-referenced-by-count":8,"title":["Provable Unlinkability Against Traffic Analysis Already After $\\mathcal{O}(\\log(n))~$ Steps!"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Gomu\u0142kiewicz","sequence":"first","affiliation":[]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Adler, M., Levine, B.N., Schields, C., Wright, M.: Defending Anonymous Communication Against Passive Logging Attacks. In: IEEE Symp. on Security and Privacy (2003)"},{"key":"30_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BFb0068322","volume-title":"S\u00e9minare de Probabilit\u00e9s XVII 1981\/1982","author":"D. Aldous","year":"1983","unstructured":"Aldous, D.: Random Walks of Finite Groups and Rapidly Mixing Markov Chains. In: Az\u00e9ma, J., Yor, M. (eds.) S\u00e9minare de Probabilit\u00e9s XVII 1981\/1982. Lecture Notes in Mathematics, vol.\u00a0986, pp. 243\u2013297. Springer, Berlin (1983)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N.: Testing Subgraphs in Large Graphs. In: ACM-SIAM FOCS 2001, pp. 434\u2013439 (2001)","DOI":"10.1109\/SFCS.2001.959918"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Berman, R., Fiat, A., Ta-Shma, A.: Provable Unlinkability Against Traffic Analysis. In: Financial Cryptography (2004)","DOI":"10.1007\/978-3-540-27809-2_26"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Bubley, B., Dyer, M.: Path Coupling: a Technique for Proving Rapid Mixing in Markov Chains. In: Bubley, B., Dyer, M. (eds.) ACM-SIAM FOCS 1997, pp. 223\u2013231 (1997)","DOI":"10.1109\/SFCS.1997.646111"},{"issue":"2","key":"30_CR6","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. CACM\u00a024(2), 84\u201388 (1981)","journal-title":"CACM"},{"issue":"1","key":"30_CR7","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(1), 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"30_CR8","unstructured":"Czumaj, A., Kanarek, P., Kuty-lowski, M., Lory\u015b, K.: Distributed Stochastic Processes for Generating Random Permutations. In: ACM-SIAM SODA 1999, pp. 271\u2013280 (1999)"},{"issue":"3-4","key":"30_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":"Czumaj, A., Kuty-lowski, M.: Delayed Path Coupling and Generating Random Permutations. Random Structures and Algorithms\u00a017(3-4), 238\u2013259 (2000)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information Hiding","author":"D.M. Goldschlag","year":"1996","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding Routing Information. In: Anderson, R. (ed.) IH 1996. LNCS, vol.\u00a01174, pp. 137\u2013150. Springer, Heidelberg (1996)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis. In: ACM STOC, pp. 672\u2013681 (1993)","DOI":"10.1145\/167088.167260"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30144-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:52:30Z","timestamp":1620013950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30144-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232087","9783540301448"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30144-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}