{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:36Z","timestamp":1772163996921,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T00:00:00Z","timestamp":1283126400000},"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,8,30]]},"DOI":"10.1145\/1851182.1851199","type":"proceedings-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T09:06:04Z","timestamp":1283245564000},"page":"123-134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Differentially-private network trace analysis"],"prefix":"10.1145","author":[{"given":"Frank","family":"McSherry","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]},{"given":"Ratul","family":"Mahajan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In VLDB , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, 1994."},{"key":"e_1_3_2_1_2_1","unstructured":"AOL search data scandal. http:\/\/en.wikipedia.org\/ wiki\/AOL_search_data_scandal. Retrieved 2010-16-01.  AOL search data scandal. http:\/\/en.wikipedia.org\/ wiki\/AOL_search_data_scandal. Retrieved 2010-16-01."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728423"},{"key":"e_1_3_2_1_4_1","unstructured":"R. Chandra R. Mahajan V. Padmanabhan and M. Zhang. CRAWDAD data set microsoft\/osdi2006 (v. 2007-05-23).  R. Chandra R. Mahajan V. Padmanabhan and M. Zhang. CRAWDAD data set microsoft\/osdi2006 (v. 2007-05-23)."},{"key":"e_1_3_2_1_5_1","volume-title":"NDSS","author":"Coull S. E.","year":"2007","unstructured":"S. E. Coull , C. V. Wright , F. Monrose , M. P. Collins , and M. K. Reiter . Playing devil'cs advocate: Inferring sensitive information from anonymized network traces . In NDSS , 2007 . S. E. Coull, C. V. Wright, F. Monrose, M. P. Collins, and M. K. Reiter. Playing devil'cs advocate: Inferring sensitive information from anonymized network traces. In NDSS, 2007."},{"key":"e_1_3_2_1_6_1","unstructured":"CRAWDAD\n  : A community resource for archiving wireless data at Dartmouth. http:\/\/crawdad.cs.dartmouth.edu\/.  CRAWDAD: A community resource for archiving wireless data at Dartmouth. http:\/\/crawdad.cs.dartmouth.edu\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402992"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.912717"},{"key":"e_1_3_2_1_11_1","unstructured":"The Internet traffic archive. http:\/\/ita.ee.lbl.gov\/.  The Internet traffic archive. http:\/\/ita.ee.lbl.gov\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402970"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015492"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_1_16_1","unstructured":"G. Minshall. tcpdriv. http:\/\/ita.ee.lbl.gov\/html\/contrib\/tcpdpriv.html.  G. Minshall. tcpdriv. http:\/\/ita.ee.lbl.gov\/html\/contrib\/tcpdpriv.html."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456441.1456445"},{"key":"e_1_3_2_1_18_1","volume-title":"HotNets","author":"Mittal P.","year":"2009","unstructured":"P. Mittal , V. Paxson , R. Summer , and M. Winterrowd . Securing mediated trace access using black-box permutation analysis . In HotNets , 2009 . P. Mittal, V. Paxson, R. Summer, and M. Winterrowd. Securing mediated trace access using black-box permutation analysis. In HotNets, 2009."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1162678.1162686"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111330"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863994"},{"key":"e_1_3_2_1_23_1","unstructured":"Network trace analysis using PINQ. http:\/\/research.microsoft.com\/pinq\/networking.aspx.  Network trace analysis using PINQ. http:\/\/research.microsoft.com\/pinq\/networking.aspx."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807247"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1752046.1752047"},{"key":"e_1_3_2_1_26_1","volume-title":"NDSS","author":"Ribeiro B.","year":"2008","unstructured":"B. Ribeiro , W. Chen , G. Miklau , and D. Towsley . Analyzing privacy in enterprise packet trace anonymization . In NDSS , 2008 . B. Ribeiro, W. Chen, G. Miklau, and D. Towsley. Analyzing privacy in enterprise packet trace anonymization. In NDSS, 2008."},{"key":"e_1_3_2_1_27_1","volume-title":"OSDI","author":"Singh S.","year":"2004","unstructured":"S. Singh , C. Estan , G. Varghese , and S. Savage . Automated worm fingerprinting . In OSDI , 2004 . S. Singh, C. Estan, G. Varghese, and S. Savage. Automated worm fingerprinting. In OSDI, 2004."},{"key":"e_1_3_2_1_28_1","volume-title":"SIGCOMM","author":"Spring N.","year":"2003","unstructured":"N. Spring , R. Mahajan , and T. Anderson . Quantifying the causes of path inflation . In SIGCOMM , 2003 . N. Spring, R. Mahajan, and T. Anderson. Quantifying the causes of path inflation. In SIGCOMM, 2003."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020830"},{"key":"e_1_3_2_1_31_1","volume-title":"ICNP","author":"Xu J.","year":"2002","unstructured":"J. Xu , J. Fan , M. Ammar , and S. Moon . Prefix-preserving IP address anonymization: Measurement-based security evaluation and a new cryptography-based scheme . In ICNP , 2002 . J. Xu, J. Fan, M. Ammar, and S. Moon. Prefix-preserving IP address anonymization: Measurement-based security evaluation and a new cryptography-based scheme. In ICNP, 2002."},{"key":"e_1_3_2_1_32_1","volume-title":"OSDI","author":"Yu Y.","year":"2008","unstructured":"Y. Yu , M. Isard , D. Fetterly , M. Budiu , Ulfar Erlingsson , P. K. Gunda , and J. Currey . DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language . In OSDI , 2008 . Y. Yu, M. Isard, D. Fetterly, M. Budiu, Ulfar Erlingsson, P. K. Gunda, and J. Currey. DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language. In OSDI, 2008."},{"key":"e_1_3_2_1_33_1","volume-title":"USENIX Security","author":"Zhang Y.","year":"2000","unstructured":"Y. Zhang and V. Paxson . Detecting stepping stones . In USENIX Security , 2000 . Y. Zhang and V. Paxson. Detecting stepping stones. In USENIX Security, 2000."}],"event":{"name":"SIGCOMM '10: ACM SIGCOMM 2010 Conference","location":"New Delhi India","acronym":"SIGCOMM '10","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2010 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1851182.1851199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:50Z","timestamp":1750234130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,30]]},"references-count":33,"alternative-id":["10.1145\/1851182.1851199","10.1145\/1851182"],"URL":"https:\/\/doi.org\/10.1145\/1851182.1851199","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1851275.1851199","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,8,30]]},"assertion":[{"value":"2010-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}