{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:26Z","timestamp":1750308746510,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,9,19]],"date-time":"2004-09-19T00:00:00Z","timestamp":1095552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,9,19]]},"DOI":"10.1145\/1133572.1133611","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Eluding carnivores"],"prefix":"10.1145","author":[{"given":"Emin G\u00fcn","family":"Sirer","sequence":"first","affiliation":[{"name":"Cornell University"}]},{"given":"Sharad","family":"Goel","sequence":"additional","affiliation":[{"name":"Cornell University"}]},{"given":"Mark","family":"Robson","sequence":"additional","affiliation":[{"name":"Cornell University"}]},{"given":"Do\u01e7an","family":"Engin","sequence":"additional","affiliation":[{"name":"Cornell University"}]}],"member":"320","published-online":{"date-parts":[[2004,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060317"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_3_1","volume-title":"The Dining Cryptographers Problem. Journal of Cryptology, 1(1):65--75","author":"Chaum D.","year":"1988","unstructured":"D. Chaum . The Dining Cryptographers Problem. Journal of Cryptology, 1(1):65--75 , 1988 . D. Chaum. The Dining Cryptographers Problem. Journal of Cryptology, 1(1):65--75, 1988."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44702-4_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586137"},{"key":"e_1_3_2_1_6_1","volume-title":"November","author":"Goldberg I.","year":"1999","unstructured":"I. Goldberg and A. Shostack . Freedom Network 1.0 Architecture , November 1999 . http:\/\/www.freedom.net\/. I. Goldberg and A. Shostack. Freedom Network 1.0 Architecture, November 1999. http:\/\/www.freedom.net\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288098"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"key":"e_1_3_2_1_9_1","volume-title":"Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In Proceedings of Middleware 2001","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable , Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In Proceedings of Middleware 2001 , Heidelberg, Germany , Nov 2001 . A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In Proceedings of Middleware 2001, Heidelberg, Germany, Nov 2001."},{"key":"e_1_3_2_1_10_1","volume-title":"Oakland Security Conference","author":"Sherwood R.","year":"2001","unstructured":"R. Sherwood , B. Bhattacharjee , and A. Srinivasan . P5: A Protocol for Scalable Anonymous Communication . In Oakland Security Conference , 2001 . R. Sherwood, B. Bhattacharjee, and A. Srinivasan. P5: A Protocol for Scalable Anonymous Communication. In Oakland Security Conference, 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352607"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/882493.884368"},{"key":"e_1_3_2_1_13_1","volume-title":"LNCS-434","author":"Waidner M.","year":"1990","unstructured":"M. Waidner and B. Pfitzmann . The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability. Advances in Cryptology , LNCS-434 , 1990 . M. Waidner and B. Pfitzmann. The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability. Advances in Cryptology, LNCS-434, 1990."}],"event":{"name":"EW04: ACM SIGOPS European Workshop 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Leuven Belgium","acronym":"EW04"},"container-title":["Proceedings of the 11th workshop on ACM SIGOPS European workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133572.1133611","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1133572.1133611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:17Z","timestamp":1750278137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133572.1133611"}},"subtitle":["file sharing with strong anonymity"],"short-title":[],"issued":{"date-parts":[[2004,9,19]]},"references-count":13,"alternative-id":["10.1145\/1133572.1133611","10.1145\/1133572"],"URL":"https:\/\/doi.org\/10.1145\/1133572.1133611","relation":{},"subject":[],"published":{"date-parts":[[2004,9,19]]},"assertion":[{"value":"2004-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}