{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:42:02Z","timestamp":1774798922129,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"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":["1553452,1527754,1422278"],"award-info":[{"award-number":["1553452,1527754,1422278"]}],"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,6,14]]},"DOI":"10.1145\/2896377.2901471","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:57:38Z","timestamp":1465552658000},"page":"153-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Rumor Source Obfuscation on Irregular Trees"],"prefix":"10.1145","author":[{"given":"Giulia","family":"Fanti","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sewoong","family":"Oh","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Whisper 2012. http:\/\/whisper.sh."},{"key":"e_1_3_2_1_2_1","unstructured":"Yik yak 2013. http:\/\/www.yikyakapp.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Secret 2014. https:\/\/www.secret.ly."},{"key":"e_1_3_2_1_4_1","unstructured":"Team blind 2015. http:\/\/us.teamblind.com\/."},{"key":"e_1_3_2_1_5_1","volume-title":"MIT Department of Economics Working Paper","author":"Acemoglu D.","year":"2015","unstructured":"D. Acemoglu, A. Makhdoumi, A. Malekian, and A. E. Ozdaglar. Privacy-constrained network formation. MIT Department of Economics Working Paper, 2015."},{"key":"e_1_3_2_1_6_1","volume-title":"Finding adam in random growing trees. arXiv preprint arXiv:1411.3317","author":"Bubeck S.","year":"2014","unstructured":"S. Bubeck, L. Devroye, and G. Lugosi. Finding adam in random growing trees. arXiv preprint arXiv:1411.3317, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/371931.371977"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866346"},{"key":"e_1_3_2_1_10_1","volume-title":"Elements of information theory","author":"Cover T. M.","year":"2012","unstructured":"T. M. Cover and J. A. Thomas. Elements of information theory. John Wiley & Sons, 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/371931.371978"},{"key":"e_1_3_2_1_12_1","volume-title":"DTIC Document","author":"Dingledine R.","year":"2004","unstructured":"R. Dingledine, N. Mathewson, and P. Syverson. Tor: The second-generation onion router. Technical report, DTIC Document, 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"Hiding the rumor source. arXiv preprint arXiv:1509.02849","author":"Fanti G.","year":"2015","unstructured":"G. Fanti, P. Kairouz, S. Oh, K. Ramchandran, and P. Viswanath. Hiding the rumor source. arXiv preprint arXiv:1509.02849, 2015."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745866"},{"key":"e_1_3_2_1_15_1","volume-title":"Network infusion to infer information sources in networks","author":"Feizi S.","year":"2014","unstructured":"S. Feizi, K. Duffy, M. Kellis, and M. Medard. Network infusion to infer information sources in networks. 2014."},{"key":"e_1_3_2_1_16_1","volume-title":"Predicting the sources of an outbreak with a spectral technique. arXiv:1211.2333","author":"Fioriti V.","year":"2012","unstructured":"V. Fioriti and M. Chinnici. Predicting the sources of an outbreak with a spectral technique. arXiv:1211.2333, 2012."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586137"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48653-5_32"},{"key":"e_1_3_2_1_19_1","volume-title":"Herbivore: A scalable and efficient protocol for anonymous communication. Technical report","author":"Goel S.","year":"2003","unstructured":"S. Goel, M. Robson, M. Polte, and E. Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Technical report, 2003."},{"key":"e_1_3_2_1_20_1","first-page":"2004","article-title":"Dining cryptographers revisited","author":"Golle P.","year":"2004","unstructured":"P. Golle and A. Juels. Dining cryptographers revisited. In Advances in Cryptology-Eurocrypt 2004, 2004.","journal-title":"Advances in Cryptology-Eurocrypt"},{"key":"e_1_3_2_1_21_1","volume-title":"Asymptotic behavior of the eden model with positively homogeneous edge weights. arXiv preprint arXiv:1508.05140","author":"Gwynne E.","year":"2015","unstructured":"E. Gwynne and S. Bubeck. Asymptotic behavior of the eden model with positively homogeneous edge weights. arXiv preprint arXiv:1508.05140, 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"The theory of branching processes","author":"Harris T. E.","year":"2002","unstructured":"T. E. Harris. The theory of branching processes. Courier Corporation, 2002."},{"key":"e_1_3_2_1_23_1","volume-title":"Persistence of centrality in random growing trees. arXiv preprint arXiv:1511.01975","author":"Jog V.","year":"2015","unstructured":"V. Jog and P. Loh. Persistence of centrality in random growing trees. arXiv preprint arXiv:1511.01975, 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"Analysis of centrality in sublinear preferential attachment trees via the cmj branching process. arXiv preprint arXiv:1601.06448","author":"Jog V.","year":"2016","unstructured":"V. Jog and P. Loh. Analysis of centrality in sublinear preferential attachment trees via the cmj branching process. arXiv preprint arXiv:1601.06448, 2016."},{"key":"e_1_3_2_1_25_1","volume-title":"How to identify an infection source with limited observations","author":"Luo W.","year":"2013","unstructured":"W. Luo, W. Tay, and M. Leng. How to identify an infection source with limited observations. 2013."},{"key":"e_1_3_2_1_26_1","volume-title":"Rumor spreading and source identification: A hide and seek game. arXiv preprint arXiv:1504.04796","author":"Luo W.","year":"2015","unstructured":"W. Luo, W. P. Tay, and M. Leng. Rumor spreading and source identification: A hide and seek game. arXiv preprint arXiv:1504.04796, 2015."},{"key":"e_1_3_2_1_27_1","volume-title":"Localized epidemic detection in networks with overwhelming noise","author":"Meirom E. A.","year":"2014","unstructured":"E. A. Meirom, C. Milling, C. Caramanis, S. Mannor, A. Orda, and S. Shakkottai. Localized epidemic detection in networks with overwhelming noise. 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254784"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491288.2491294"},{"key":"e_1_3_2_1_30_1","volume-title":"Locating the source of diffusion in large-scale networks. Physical review letters, 109(6):068702","author":"Pinto P. C.","year":"2012","unstructured":"P. C. Pinto, P. Thiran, and M. Vetterli. Locating the source of diffusion in large-scale networks. Physical review letters, 109(6):068702, 2012."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.136"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1811099.1811063"},{"key":"e_1_3_2_1_33_1","volume-title":"Finding rumor sources on random graphs. arXiv preprint arXiv:1110.6230","author":"Shah D.","year":"2011","unstructured":"D. Shah and T. Zaman. Finding rumor sources on random graphs. arXiv preprint arXiv:1110.6230, 2011."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825262"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948128"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591993"},{"key":"e_1_3_2_1_39_1","volume-title":"A robust information source estimator with sparse observations. arXiv:1309.4846","author":"Zhu K.","year":"2013","unstructured":"K. Zhu and L. Ying. A robust information source estimator with sparse observations. arXiv:1309.4846, 2013."}],"event":{"name":"SIGMETRICS '16: SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Antibes Juan-les-Pins France","acronym":"SIGMETRICS '16","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","IFIP"]},"container-title":["Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2896377.2901471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2896377.2901471","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2896377.2901471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:42:01Z","timestamp":1763458921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2896377.2901471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":39,"alternative-id":["10.1145\/2896377.2901471","10.1145\/2896377"],"URL":"https:\/\/doi.org\/10.1145\/2896377.2901471","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2964791.2901471","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}