{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:20Z","timestamp":1750307480475,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"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":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866399","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:38:23Z","timestamp":1286289503000},"page":"690-692","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Rendezvous tunnel for anonymous publishing"],"prefix":"10.1145","author":[{"given":"Ofer","family":"Hermoni","sequence":"first","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}]},{"given":"Eyal","family":"Felstaine","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}]},{"given":"Yuval","family":"Elovici","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer-Sheva, Israel"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0128-6"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","first-page":"48","volume-title":"The decision diffie-hellman problem","year":"1998","unstructured":"}}. Boneh. The decision diffie-hellman problem . In Lecture Notes in Computer Science , pages 48 -- 63 . Springer-Verlag , 1998 . }}. Boneh. The decision diffie-hellman problem. In Lecture Notes in Computer Science, pages 48--63. Springer-Verlag, 1998."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_4_1","first-page":"46","volume-title":"Workshop on Design Issues in Anonymity and Unobservability","author":"Sandberg O.","year":"2000","unstructured":"}}. Clarke, O. Sandberg , B. Wiley and T. Hong . Freenet: A distributed anonymous information storage and retrieval system . In Workshop on Design Issues in Anonymity and Unobservability , pages 46 -- 66 , 2000 . }}. Clarke, O. Sandberg, B. Wiley and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, pages 46--66, 2000."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issuesin Anonymity and Unobservability, Springer-Verlag,LNCS 2009","author":"Freedman M. J.","year":"2000","unstructured":"}}. Dingledine, M. J. Freedman and D. Molnar . The free haven project: Distributed anonymous storage service . In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issuesin Anonymity and Unobservability, Springer-Verlag,LNCS 2009 , July 2000 . }}. Dingledine, M. J. Freedman and D. Molnar. The free haven project: Distributed anonymous storage service. In Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issuesin Anonymity and Unobservability, Springer-Verlag,LNCS 2009, July 2000."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 13th USENIX Security Symposium","author":"Mathewson N.","year":"2004","unstructured":"}}. Dingledine, N. Mathewson and P. Syverson . Tor: The second-generation onion router . In Proceedings of the 13th USENIX Security Symposium , August 2004 . }}. Dingledine, N. Mathewson and P. Syverson. Tor: The second-generation onion router. In Proceedings of the 13th USENIX Security Symposium, August 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/354876.354877"},{"key":"e_1_3_2_1_8_1","first-page":"310","volume-title":"COMSWARE","author":"Gilboa N.","year":"2008","unstructured":"}}. Hermoni, N. Gilboa , E. Felstaine and S. Shitrit . Deniability - an alibi for users in p2p networks , In COMSWARE , pages 310 -- 317 , 2008 . }}. Hermoni, N. Gilboa, E. Felstaine and S. Shitrit. Deniability - an alibi for users in p2p networks, In COMSWARE, pages 310--317, 2008."},{"key":"e_1_3_2_1_9_1","first-page":"59","volume-title":"Proceedings of the 9th USENIX Security Symposium","author":"R.","year":"2000","unstructured":"}}. R. Marc Waldman and L. Cranor. Publius: A robust, tamper-evident, censorship-resistant andsource-anonymous web publishing system . In Proceedings of the 9th USENIX Security Symposium , pages 59 -- 72 , August 2000 . }}. R. Marc Waldman and L. Cranor. Publius: A robust, tamper-evident, censorship-resistant andsource-anonymous web publishing system. In Proceedings of the 9th USENIX Security Symposium, pages 59--72, August 2000."},{"key":"e_1_3_2_1_10_1","volume-title":"A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability,unobservability, pseudonymity, and identity management","author":"Hansen M.","year":"2010","unstructured":"}}. Pfitzmann and M. Hansen . A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability,unobservability, pseudonymity, and identity management . Aug. 2010 . v0.34. }}. Pfitzmann and M. Hansen. A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability,unobservability, pseudonymity, and identity management. Aug. 2010. v0.34."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"volume-title":"Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 2002","year":"2002","key":"e_1_3_2_1_13_1","unstructured":"}}. Serjantov. Anonymizing censorship resistant systems . In Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 2002 ), March 2002 . }}. Serjantov. Anonymizing censorship resistant systems. In Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 2002), March2002."},{"key":"e_1_3_2_1_14_1","first-page":"299","article-title":"Anonymity scheme for interactive p2p services","volume":"10","author":"Felstaine E.","year":"2009","unstructured":"}}. Shitrit, E. Felstaine , N. Gilboa , and O. Hermoni . Anonymity scheme for interactive p2p services . Journal of Internet Technology , 10 : 299 -- 312 , 2009 . }}. Shitrit, E. Felstaine, N. Gilboa, and O. Hermoni. Anonymity scheme for interactive p2p services. Journal of Internet Technology, 10:299--312, 2009.","journal-title":"Journal of Internet Technology"},{"key":"e_1_3_2_1_15_1","first-page":"44","volume-title":"Proceedings of the IEEE 18th Annual Symposium on Security and Privacy","author":"Goldsclag D.","year":"1997","unstructured":"}}. Syverson, D. Goldsclag , and M. Reed . Anonymous connections and onion routing . In Proceedings of the IEEE 18th Annual Symposium on Security and Privacy , pages 44 -- 54 , Oakland, California, 4--7 1997 . }}. Syverson, D. Goldsclag, and M. Reed. Anonymous connections and onion routing. In Proceedings of the IEEE 18th Annual Symposium on Security and Privacy, pages 44--54, Oakland, California, 4--7 1997."}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Chicago Illinois USA","acronym":"CCS '10"},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:59Z","timestamp":1750248539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":15,"alternative-id":["10.1145\/1866307.1866399","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866399","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}