{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:50:21Z","timestamp":1725454221597},"publisher-location":"New York","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387244859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-24486-7_1","type":"book-chapter","created":{"date-parts":[[2005,10,9]],"date-time":"2005-10-09T22:15:45Z","timestamp":1128896145000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Duo-Onions and Hydra-Onions \u2014 Failure and Adversary Resistant Onion Protocols"],"prefix":"10.1007","author":[{"given":"Jan","family":"Iwanik","sequence":"first","affiliation":[]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[]},{"given":"Miroslaw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N.: Testing Subgraphs in Large Graphs. ACM-SIAM FOCS 2001, 434\u2013439.","DOI":"10.1109\/SFCS.2001.959918"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Berman R., Fiat A., Ta-Shma A.: Provable Unlinkability Against Traffic Analysis. Accepted for Financial Cryptography 2004.","DOI":"10.1007\/978-3-540-27809-2_26"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Berthold, O., Federrath, H., K\u00f6hntopp, M.: Project \u201cAnonymity and Unobservability in the Internet.\u201d Workshop on Freedom and Privacy by Design \/ CFP2000, ACM, 2000, 57\u201365.","DOI":"10.1145\/332186.332211"},{"issue":"2","key":"1_CR4","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 24(2) (1981) 84\u201388.","journal-title":"CACM"},{"issue":"1","key":"1_CR5","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 1(1) (1988), 65\u201375.","journal-title":"Journal of Cryptology"},{"key":"1_CR6","unstructured":"Czumaj, A., Kanarek, P., Kuty\u0142owski, M., Lory\u015b K.: Distributed Stochastic Processes for Generating Random Permutations. 10 ACM-SIAM SODA, 1999 271\u2013280."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Freedman, J., Sit, E., Cates, J., Morris, R.: Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer 1st International Workshop on Peer-to-Peer Systems (IPTPS02), Lecture Notes in Computer Science 2429. Springer-Verlag, 2002, 121\u2013129.","DOI":"10.1007\/3-540-45748-8_12"},{"key":"1_CR8","unstructured":"Gogolewski, M., Kuty\u0142owski, M., \u0141uczak, T: Distributed Time stamping with Boomerang Onions. Manuscript."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gomu\u0142kiewicz, M., Klonowski, M., Kuty\u0142owski, M.: Provable Unlinkability Against Traffic Analysis already after $$O$$ (log(n)) steps!. Manuscript, 2004.","DOI":"10.1007\/978-3-540-30144-8_30"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kesdogan D., Egner J., B\u00fcschkes R.: Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System. Information Hiding '98 Lecture Notes in Computer Science 1525. Springer-Verlag, 83\u201398.","DOI":"10.1007\/3-540-49380-8_7"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.3233\/JCS-1997-5305","volume":"5","author":"P. F. Syverson","year":"1997","unstructured":"Syverson P. F., Reed M. G., Goldschlag D. M.: Private Web Browsing. Journal of Computer Security Special Issue on Web Security 5 (1997) 237\u2013248.","journal-title":"Journal of Computer Security Special Issue on Web Security"},{"issue":"4","key":"1_CR12","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. 16(4) (1998) 482\u2013494.","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Syverson, P., Tsudik, G., Reed, M., Landwehr., C.: Towards an Analysis of Onion Routing Security. Workshop on Design Issues in Anonymity and Unobservability, July 2000.","DOI":"10.21236\/ADA465255"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Rackoff C, Simon D.R.: Cryptographic Defense Against Traffic Analysis. 25 ACM Symposium on Theory of Computing (1993) 672\u2013681.","DOI":"10.1145\/167088.167260"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Wright, M., Adler, M., Levine, B., Schields, C.: Defending Anonymous Communication Against Passive Logging Attacks. IEEE Symposium on Security and Privacy 2003, IEEE Computer Society, 28\u201338.","DOI":"10.1109\/SECPRI.2003.1199325"}],"container-title":["IFIP \u2014 The International Federation for Information Processing","Communications and Multimedia Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-24486-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:35Z","timestamp":1605643115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-24486-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387244859"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/0-387-24486-7_1","relation":{},"subject":[]}}