{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:56Z","timestamp":1725550496479},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290391"},{"type":"electronic","value":"9783540314813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558859_3","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T04:59:13Z","timestamp":1132721953000},"page":"26-38","source":"Crossref","is-referenced-by-count":8,"title":["Provable Anonymity for Networks of Mixes"],"prefix":"10.1007","author":[{"given":"Marek","family":"Klonowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","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":"1981","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, Heidelberg (1981)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-44436-X_8","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"V. Auletta","year":"2000","unstructured":"Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P.: Randomized Path Coloring on Binary Trees. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 60\u201371. Springer, Heidelberg (2000)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-27809-2_26","volume-title":"Financial Cryptography","author":"R. Berman","year":"2004","unstructured":"Berman, R., Fiat, A., Ta-Shma, A.: Provable Unlinkability Against Traffic Analysis. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 266\u2013280. Springer, Heidelberg (2004)"},{"key":"3_CR4","first-page":"223","volume":"38","author":"B. Bubley","year":"1997","unstructured":"Bubley, B., Dyer, M.: Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. ACM-SIAM FOCS\u00a038, 223\u2013231 (1997)","journal-title":"ACM-SIAM FOCS"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4613-0281-0_2","volume-title":"Switching Networks: Recent Advances","author":"A. Czumaj","year":"2001","unstructured":"Czumaj, A., Kanarek, P., Kuty\u0142owski, M., Lory\u015b, K.: Switching Networks for Generating Random Permutations. In: Switching Networks: Recent Advances, pp. 25\u201361. Kluwer Academic Publishers, Dordrecht (2001); ISBN 0-7923-6953-X"},{"issue":"3-4","key":"3_CR6","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\u0142owski, 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":"3_CR7","unstructured":"Dingledine, R.: Anonymity Bibliography, \n                    \n                      http:\/\/freehaven.net\/anonbib\/"},{"issue":"2","key":"3_CR8","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"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.F.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) RSA-CT 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Golle, P., Juels, A.: Parallel Mixing. In: ACM Conference on Computer and Communications Security (CCS), pp. 220\u2013226 (2004)","DOI":"10.1145\/1030083.1030113"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-39650-5_8","volume-title":"Computer Security \u2013 ESORICS 2003","author":"M. Gomu\u0142kiewicz","year":"2003","unstructured":"Gomu\u0142kiewicz, M., Klonowski, M., Kuty\u0142owski, M.: Rapid Mixing and Security of Chaum\u2019s Visual Electronic Voting. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 132\u2013145. Springer, Heidelberg (2003)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-30144-8_30","volume-title":"Information Security","author":"M. Gomu\u0142kiewicz","year":"2004","unstructured":"Gomu\u0142kiewicz, M., Klonowski, M., Kuty\u0142owski, M.: Provable Unlinkability Against Traffic Analysis Already After \n                    \n                      \n                    \n                    $\\mathcal{O}(\\log(n))$\n                   Steps! In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 354\u2013366. Springer, Heidelberg (2004)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/NDSS.1996.492350","volume-title":"ISOC Symposium on Network and Distributed System Security","author":"C. G\u00fclc\u00fc","year":"1996","unstructured":"G\u00fclc\u00fc, C., Tsudik, G.: Mixing E-mail with BABEL. In: ISOC Symposium on Network and Distributed System Security, pp. 2\u201316. IEEE, Los Alamitos (1996)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-49380-8_7","volume-title":"Information Hiding","author":"D. Kesdogan","year":"1998","unstructured":"Kesdogan, D., Egner, J., B\u00fcschkes, R.: Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol.\u00a01525, pp. 83\u201398. Springer, Heidelberg (1998)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis. In: ACM Symposium on Theory of Computing, vol.\u00a025, pp. 672\u2013681 (1993)","DOI":"10.1145\/167088.167260"},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"P.F. Syverson","year":"1998","unstructured":"Syverson, P.F., Reed, M.G., Goldschlag, D.M.: Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communication\u00a016(4), 482\u2013494 (1998)","journal-title":"IEEE Journal on Selected Areas in Communication"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558859_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:24Z","timestamp":1619493024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558859_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290391","9783540314813"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11558859_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}