{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:55Z","timestamp":1725558715476},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240150"},{"type":"electronic","value":"9783540318156"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31815-6_32","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T12:44:24Z","timestamp":1277901864000},"page":"400-410","source":"Crossref","is-referenced-by-count":17,"title":["Onions Based on Universal Re-encryption \u2013 Anonymous Communication Immune Against Repetitive Attack"],"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":"32_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)"},{"key":"32_CR2","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":"R. B\u00fcschkes","year":"1998","unstructured":"B\u00fcschkes, R., Egner, J., Kesdogan, D.: 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)"},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","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. Communications of ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of ACM"},{"issue":"1","key":"32_CR4","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"},{"doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the Second Generation Onion Router. USENIX Security (2004)","key":"32_CR5","DOI":"10.21236\/ADA465464"},{"key":"32_CR6","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)"},{"key":"32_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":"32_CR8","first-page":"237","volume":"5","author":"D.M. Goldschlag","year":"1997","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: PrivateWeb Browsing. Journal of Computer Security. Special Issue on Web Security\u00a05, 237\u2013248 (1997)","journal-title":"Journal of Computer Security. Special Issue on Web Security"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"D.M. Goldschlag","year":"1998","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: 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"},{"key":"32_CR10","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.: Universal Re-encryption for Mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"key":"32_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 O(log(n)) Steps! In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 354\u2013366. Springer, Heidelberg (2004)"},{"key":"32_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)"},{"doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: 20th ACM Symposium on Principles of Distributed Computing 2001, pp. 284\u2013292 (2001)","key":"32_CR13","DOI":"10.1145\/383962.384046"},{"doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis. In: 25th ACM Symposium on Theory of Computing, pp. 672\u2013681 (1993)","key":"32_CR14","DOI":"10.1145\/167088.167260"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31815-6_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:41:20Z","timestamp":1619998880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31815-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540240150","9783540318156"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31815-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}