{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:13:21Z","timestamp":1743066801373,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689133"},{"type":"electronic","value":"9783540689140"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68914-0_18","type":"book-chapter","created":{"date-parts":[[2008,5,26]],"date-time":"2008-05-26T04:58:06Z","timestamp":1211777886000},"page":"296-308","source":"Crossref","is-referenced-by-count":2,"title":["Repelling Detour Attack Against Onions with Re-encryption"],"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"}]},{"given":"Anna","family":"Lauks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11836810_4","volume-title":"Information Security","author":"G. Danezis","year":"2006","unstructured":"Danezis, G.: Breaking Four Mix-Related Schemes Based on Universal Re-encryption. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol.\u00a04176, pp. 46\u201359. Springer, Heidelberg (2006)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/978-3-540-31815-6_32","volume-title":"Information Security Applications","author":"K.M. Gomu\u0142kiewicz","year":"2005","unstructured":"Gomu\u0142kiewicz, K.M., Kuty\u0142owski, M.: Onions Based on Universal Re-encryption \u2013 Anonymous Communication Immune Against Repetitive Attack. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 400\u2013410. Springer, Heidelberg (2005)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-540-30144-8_30","volume-title":"ISC 2004","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":"18_CR7","unstructured":"Klonowski, M., Kuty\u0142owski, M., Lauks, A., Zag\u00f3rski, F.: Universal Re-encryption of Signatures and Controlling Anonymous Information Flow. In: WARTACRYPT 2004 Conference on Cryptology, vol.\u00a033, pp. 179\u2013188. Tatra Mountains Mathematical Publications (2006)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","first-page":"229","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"M. Kuty\u0142owski","year":"2005","unstructured":"Kuty\u0142owski, M., Klonowski, M., Zag\u00f3rski, F.: Anonymous Communication with On-line and Off-line Onion Encoding. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 229\u2013238. Springer, Heidelberg (2005)"},{"key":"18_CR9","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"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"Public Key Cryptography","author":"Y. Tsiounis","year":"1998","unstructured":"Tsiounis, Y., Yung, M.: On the Security of ElGamal Based Encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 117\u2013134. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68914-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:33:23Z","timestamp":1558265603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68914-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540689133","9783540689140"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68914-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}