{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:34:01Z","timestamp":1763458441434,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1553301"],"award-info":[{"award-number":["1553301"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,24]]},"DOI":"10.1145\/2976749.2978367","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T08:46:35Z","timestamp":1477385195000},"page":"1727-1738","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["GAME OF DECOYS"],"prefix":"10.1145","author":[{"given":"Milad","family":"Nasr","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]},{"given":"Amir","family":"Houmansadr","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"issue":"9","key":"e_1_3_2_1_2_1","article-title":"Protecting User Privacy on the Web","volume":"4","author":"Boyan J.","year":"1997","unstructured":"J. Boyan. The Anonymizer: Protecting User Privacy on the Web. Computer-Mediated Communication Magazine, 4(9), Sept. 1997.","journal-title":"Computer-Mediated Communication Magazine"},{"key":"e_1_3_2_1_3_1","unstructured":"The CAIDA UCSD {AS Relationships} - {Jan 2016}. http:\/\/www.caida.org\/data\/as-relationships\/."},{"key":"e_1_3_2_1_4_1","volume-title":"Optimizing the placement of implicit proxies. https:\/\/www.cs.princeton.edu\/jrex\/papers\/decoy-routing.pdf","author":"Cesareo J.","year":"2012","unstructured":"J. Cesareo, J. Karlin, J. Rexford, and M. Schapira. Optimizing the placement of implicit proxies. https:\/\/www.cs.princeton.edu\/jrex\/papers\/decoy-routing.pdf, 2012."},{"key":"e_1_3_2_1_5_1","unstructured":"J. Cowie. Egypt Leaves the Internet. http:\/\/www.renesys.com\/blog\/2011\/01\/egypt-leaves-the-internet.shtml January 2011. Online Article."},{"key":"e_1_3_2_1_6_1","first-page":"5246","article-title":"The Transport Layer Security (TLS) protocol -- version 1.2","author":"Dierks T.","year":"2008","unstructured":"T. Dierks and E. Rescorla. The Transport Layer Security (TLS) protocol -- version 1.2. Internet RFC 5246, 2008.","journal-title":"Internet RFC"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2015.7366287"},{"key":"e_1_3_2_1_9_1","volume-title":"Submodular functions and optimization","author":"Fujishige S.","year":"2005","unstructured":"S. Fujishige. Submodular functions and optimization, volume 58. Elsevier, 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9647.001.0001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046730"},{"key":"e_1_3_2_1_13_1","volume-title":"NDSS","author":"Houmansadr A.","year":"2013","unstructured":"A. Houmansadr, T. Riedl, N. Borisov, and A. Singer. I Want my Voice to be Heard: IP over Voice-over-IP for Unobservable Censorship Circumvention. In NDSS, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23292"},{"key":"e_1_3_2_1_15_1","unstructured":"J. Jia and P. Smith. Psiphon: Analysis and Estimation. http:\/\/www.cdf.toronto.edu\/ csc494h\/reports\/2004-fall\/psiphon_ae.html 2004."},{"key":"e_1_3_2_1_16_1","volume-title":"USENIX FOCI","author":"Karlin J.","year":"2011","unstructured":"J. Karlin, D. Ellard, A. W. Jackson, C. E. Jones, G. Lauer, D. P. Mankins, and W. T. Strayer. Decoy routing: Toward unblockable internet communication. In USENIX FOCI, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2013.107"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1051910"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296179"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2005.1541716"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382209"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652124"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2671225.2671236"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2028067.2028097"}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Vienna Austria","acronym":"CCS'16"},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978367","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:23:39Z","timestamp":1763457819000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978367"}},"subtitle":["Optimal Decoy Routing Through Game Theory"],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":26,"alternative-id":["10.1145\/2976749.2978367","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978367","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}