{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:09Z","timestamp":1750306809215,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T00:00:00Z","timestamp":1395619200000},"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":[[2014,3,24]]},"DOI":"10.1145\/2554850.2555006","type":"proceedings-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T15:08:30Z","timestamp":1406041710000},"page":"501-508","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hiding user content interest while preserving P2P performance"],"prefix":"10.1145","author":[{"given":"Riccardo","family":"Petrocco","sequence":"first","affiliation":[{"name":"Technische Universiteit Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Capot\u0103","sequence":"additional","affiliation":[{"name":"Technische Universiteit Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Pouwelse","sequence":"additional","affiliation":[{"name":"Technische Universiteit Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dick H. J.","family":"Epema","sequence":"additional","affiliation":[{"name":"Technische Universiteit Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,3,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Anonymizer. http:\/\/www.anonymizer.com.  Anonymizer. http:\/\/www.anonymizer.com."},{"key":"e_1_3_2_1_2_1","unstructured":"Net index. http:\/\/netindex.com.  Net index. http:\/\/netindex.com."},{"key":"e_1_3_2_1_3_1","volume-title":"Nov.","author":"Bakker A.","year":"2013","unstructured":"A. Bakker , R. Petrocco , and V. Grishchenko . Peer-to-peer streaming peer protocol (ppspp) , Nov. 2013 . IETF draft. A. Bakker, R. Petrocco, and V. Grishchenko. Peer-to-peer streaming peer protocol (ppspp), Nov. 2013. IETF draft."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1461464.1461465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877891.1877898"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_7_1","volume-title":"Swarmscreen: Privacy through plausible deniability in P2P systems. Technical report","author":"Choffnes D.","year":"2009","unstructured":"D. Choffnes , J. Duch , D. Malmgren , R. Guierma , F. E. Bustamante , and L. Amaral . Swarmscreen: Privacy through plausible deniability in P2P systems. Technical report , Northwestern University , 2009 . D. Choffnes, J. Duch, D. Malmgren, R. Guierma, F. E. Bustamante, and L. Amaral. Swarmscreen: Privacy through plausible deniability in P2P systems. Technical report, Northwestern University, 2009."},{"key":"e_1_3_2_1_8_1","unstructured":"B. Cohen. Bittorrent protocol 1.0. http:\/\/www.bittorrent.org.  B. Cohen. Bittorrent protocol 1.0. http:\/\/www.bittorrent.org."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/506106.506115"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586137"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293443"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851198"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068822"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70630-4_5"},{"key":"e_1_3_2_1_16_1","volume-title":"The bittorrent anonymity marketplace. CoRR, abs\/1108.2718","author":"Nielson S. J.","year":"2011","unstructured":"S. J. Nielson and D. S. Wallach . The bittorrent anonymity marketplace. CoRR, abs\/1108.2718 , 2011 . S. J. Nielson and D. S. Wallach. The bittorrent anonymity marketplace. CoRR, abs\/1108.2718, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046731"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. USENIX Workshop on Hot Topics in Security (HotSec)","author":"Walls R. J.","year":"2011","unstructured":"R. J. Walls , B. N. Levine , M. Liberatore , and C. Shields . Effective digital forensics research is investigator-centric . In Proc. USENIX Workshop on Hot Topics in Security (HotSec) , 2011 . R. J. Walls, B. N. Levine, M. Liberatore, and C. Shields. Effective digital forensics research is investigator-centric. In Proc. USENIX Workshop on Hot Topics in Security (HotSec), 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/977400.977981"},{"key":"e_1_3_2_1_21_1","first-page":"2","volume-title":"New efficient replacement strategies for","author":"Wang J.","year":"2004","unstructured":"J. Wang New efficient replacement strategies for p 2 p cooperative proxy cache systems. 2004 . J. Wang et al. New efficient replacement strategies for p2p cooperative proxy cache systems. 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1011"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062193"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.295"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.123"}],"event":{"name":"SAC 2014: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Gyeongju Republic of Korea","acronym":"SAC 2014"},"container-title":["Proceedings of the 29th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554850.2555006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554850.2555006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:35:03Z","timestamp":1750232103000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554850.2555006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,24]]},"references-count":25,"alternative-id":["10.1145\/2554850.2555006","10.1145\/2554850"],"URL":"https:\/\/doi.org\/10.1145\/2554850.2555006","relation":{},"subject":[],"published":{"date-parts":[[2014,3,24]]},"assertion":[{"value":"2014-03-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}