{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:55Z","timestamp":1725558895912},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243021"},{"type":"electronic","value":"9783540305774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30577-4_26","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:48:39Z","timestamp":1278272919000},"page":"229-238","source":"Crossref","is-referenced-by-count":10,"title":["Anonymous Communication with On-line and Off-line Onion Encoding"],"prefix":"10.1007","author":[{"given":"Marek","family":"Klonowski","sequence":"first","affiliation":[]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Zag\u00f3rski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","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)"},{"issue":"2","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. CACM\u00a024(2), 84\u201388 (1981)","journal-title":"CACM"},{"issue":"1","key":"26_CR3","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":"26_CR4","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the Second Generation Onion Router, USENIX Security (2004)","DOI":"10.21236\/ADA465464"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11423409_6","volume-title":"Privacy Enhancing Technologies","author":"P. Fairbrother","year":"2005","unstructured":"Fairbrother, P.: An Improved Construction for Universal Re-encryption. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 79\u201387. Springer, Heidelberg (2005)"},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Frankling","year":"1996","unstructured":"Frankling, M., Haber, S.: Joint Encryption and Message-Efficient Secure Computation. Journal of Cryptology\u00a09(4), 217\u2013232 (1996)","journal-title":"Journal of Cryptology"},{"key":"26_CR7","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":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11423409_4","volume-title":"Privacy Enhancing Technologies","author":"P. Golle","year":"2005","unstructured":"Golle, P.: Reputable Mix Networks. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 51\u201362. Springer, Heidelberg (2005)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal Re-encryption for Mixnets. In: RSA-CT 2004, pp. 163\u2013178 (2004)","DOI":"10.1007\/978-3-540-24660-2_14"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security Applications","author":"M. Gomu\u0142kiewicz","year":"2005","unstructured":"Gomu\u0142kiewicz, M., Klonowski, M., Kuty\u0142owski, M.: Anonymous Communication Immune against Repetitive Attack. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325. Springer, Heidelberg (2005)"},{"key":"26_CR11","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":"26_CR12","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":"26_CR13","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":"26_CR14","first-page":"672","volume":"25","author":"C. Rackoff","year":"1993","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis. ACM STOC\u00a025, 672\u2013681 (1993)","journal-title":"ACM STOC"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2005: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30577-4_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:31:03Z","timestamp":1620012663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30577-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243021","9783540305774"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30577-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}