{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:55:25Z","timestamp":1773510925010,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"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":["CNS-1409415 CNS-1423139 CNS-1553437 CNS-1617286"],"award-info":[{"award-number":["CNS-1409415 CNS-1423139 CNS-1553437 CNS-1617286"]}],"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.2978319","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T08:46:35Z","timestamp":1477385195000},"page":"492-503","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["SmartWalk"],"prefix":"10.1145","author":[{"given":"Yushan","family":"Liu","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Shouling","family":"Ji","sequence":"additional","affiliation":[{"name":"Zhejiang University & Georgia Tech, Zhejiang, China"}]},{"given":"Prateek","family":"Mittal","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Google unveils uproxy an anti-censorship browser extension. http:\/\/thetechjournal.com\/internet\/google-unveils-uproxy.xhtml."},{"key":"e_1_3_2_1_2_1","unstructured":"Lantern - open internet for everyone. http:\/\/www.getlantern.org."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0068322"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2006.126"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23260"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2228298.2228319"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"e_1_3_2_1_10_1","volume-title":"Comprehensive survey on distance\/similarity measures between probability density functions","author":"Cha S.-H.","year":"2007","unstructured":"S.-H. Cha. Comprehensive survey on distance\/similarity measures between probability density functions, 2007."},{"key":"e_1_3_2_1_11_1","volume-title":"Mixing time of random walks on graphs. Master's thesis","author":"Chen M.","year":"2004","unstructured":"M. Chen. Mixing time of random walks on graphs. Master's thesis, University of York, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881151.1881163"},{"key":"e_1_3_2_1_13_1","volume-title":"NDSS","author":"Danezis G.","year":"2009","unstructured":"G. Danezis and P. Mittal. Sybilinfer: Detecting sybil nodes using social networks. In NDSS, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005980"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1518736"},{"key":"e_1_3_2_1_17_1","volume-title":"2013 IEEE Thirteenth International Conference on","author":"Gkorou D.","year":"2013","unstructured":"D. Gkorou, T. Vinko, J. Pouwelse, and D. Epema. Leveraging node properties in random walks for robust reputations in decentralized networks. In Peer-to-Peer Computing (P2P), 2013 IEEE Thirteenth International Conference on, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488436"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0210-x"},{"key":"e_1_3_2_1_20_1","author":"Hay M.","year":"2007","unstructured":"M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. the International Journal on Very Large Data Bases, 2007.","journal-title":"Anonymizing social networks. the International Journal on Very Large Data Bases"},{"key":"e_1_3_2_1_21_1","volume-title":"A quantitative measure of fairness and discrimination for resource allocation in shared computer systems","author":"Jain R.","year":"1998","unstructured":"R. Jain, D.-M. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. 1998."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813724"},{"key":"e_1_3_2_1_23_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855711.1855719"},{"key":"e_1_3_2_1_25_1","volume-title":"Markov chains and mixing times","author":"Levin D. A.","year":"2009","unstructured":"D. A. Levin, Y. Peres, and E. L. Wilmer. Markov chains and mixing times. American Mathematical Society, 2009."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813693"},{"key":"e_1_3_2_1_27_1","volume-title":"Linkmirage: Enabling privacy-preserving analytics on social relationships","author":"Liu C.","year":"2016","unstructured":"C. Liu and P. Mittal. Linkmirage: Enabling privacy-preserving analytics on social relationships. 2016."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/58007"},{"key":"e_1_3_2_1_29_1","volume-title":"Random Walks on Graphs: A Survey","author":"Lovasz L.","year":"1996","unstructured":"L. Lovasz. Random Walks on Graphs: A Survey, volume 2. J\u00e1nos Bolyai Mathematical Society, 1996."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2392622.2392628"},{"key":"e_1_3_2_1_31_1","volume-title":"Sprout: P2P Routing with Social Networks","author":"Marti S.","year":"2004","unstructured":"S. Marti, P. Ganesan, and H. Garcia-Molina. Sprout: P2P Routing with Social Networks. Springer Berlin Heidelberg, 2004."},{"key":"e_1_3_2_1_32_1","volume-title":"Network and Distributed System Security Symposium","author":"Mittal P.","year":"2012","unstructured":"P. Mittal, M. Caesar, and N. Borisov. X-vine: Secure and pseudonymous routing using social networks. Network and Distributed System Security Symposium, 2012."},{"key":"e_1_3_2_1_33_1","volume-title":"NDSS","author":"Mittal P.","year":"2013","unstructured":"P. Mittal, C. Papamanthou, and D. Song. Preserving link privacy in social network based systems. In NDSS, 2013."},{"key":"e_1_3_2_1_34_1","volume-title":"NDSS","author":"Mittal P.","year":"2013","unstructured":"P. Mittal, M. Wright, and N. Borisov. Pisces: Anonymous communication using social networks. NDSS, 2013."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934998"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879191"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779330.1779346"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1929820.1929830"},{"key":"e_1_3_2_1_39_1","volume-title":"Social Networks","author":"Newman M. E. J.","year":"2005","unstructured":"M. E. J. Newman. A measure of betweenness centrality based on random walks. Social Networks, 2005."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"e_1_3_2_1_41_1","unstructured":"Y. Sovran J. Li and L. Subramanian. Unblocking the internet: Social networks foil censors."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2831143.2831179"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935171"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558979"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519089"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2507822"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187847"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.13"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159945"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558999"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793474.1793485"}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria","acronym":"CCS'16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"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.2978319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978319","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:25:07Z","timestamp":1763457907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978319"}},"subtitle":["Enhancing Social Network Security via Adaptive Random Walks"],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":54,"alternative-id":["10.1145\/2976749.2978319","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978319","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"}}]}}