{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:51:07Z","timestamp":1725763867407},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486356","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"1736-1744","source":"Crossref","is-referenced-by-count":7,"title":["Quantifying Graph Anonymity, Utility, and De-anonymity"],"prefix":"10.1109","author":[{"given":"Shouling","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raheem","family":"Beyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"SecGraph","year":"0","key":"ref32"},{"key":"ref31","article-title":"SecGraph: A Uniform and Open-source Evaluation System for Graph Data Anonymization and De-anonymization","author":"ji","year":"2015","journal-title":"Usenix Security"},{"year":"0","key":"ref30"},{"journal-title":"Calibrating Data to Sensitivity in Private Data Analysis VLDB","year":"2014","author":"proserpio","key":"ref10"},{"journal-title":"Preserving Differential Privacy in Degree-Correlation based Graph Generation TDP","year":"2013","author":"wang","key":"ref11"},{"journal-title":"Differentially Private Network Data Release via Structural Inference KDD","year":"2014","author":"xiao","key":"ref12"},{"journal-title":"Preserving link privacy in social network based systems","year":"2013","author":"mittal","key":"ref13"},{"journal-title":"Wherefore Art Thou R3579X? Anonymized Social Networks Hidden Patterns and Structural Steganography WWW","year":"2007","author":"backstrom","key":"ref14"},{"journal-title":"De-anonymizing Social Networks S&P","year":"2009","author":"narayanan","key":"ref15"},{"journal-title":"Community-enhanced De-anonymization of Online Social Networks CCS","year":"2014","author":"nilizadeh","key":"ref16"},{"journal-title":"Deononymizing Mobility Traces Using Social Networks as a Side-Channel CCS","year":"2012","author":"srivatsa","key":"ref17"},{"journal-title":"Structure based Data De-anonymization of Social Networks and Mobility Traces ISC","year":"2014","author":"ji","key":"ref18"},{"journal-title":"On the Privacy of Anonymized Networks KDD","year":"2011","author":"pedarsani","key":"ref19"},{"journal-title":"Connecting the dots Can the Tools of Grepha Theory and Social-network Studies Unravel the Next Big Plot? American Scientist","year":"2006","author":"hayes","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"ref27","article-title":"NicheWorksInteractive Visualization of Very Large Graphs","author":"wills","year":"1999","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"journal-title":"K-isomorphism Privacy Preserving Network Publication Against Structural Attacks","year":"2010","author":"cheng","key":"ref6"},{"year":"0","key":"ref29"},{"journal-title":"K-automorphism A general framework for privacy preserving network publication","year":"2009","author":"zou","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1533057.1533088"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"journal-title":"Randomizing Social Networks a Spectrum Preserving Approach SDM","year":"2008","author":"ying","key":"ref2"},{"journal-title":"Sharing Graphs using Differentially Private Graph Models IMC","year":"2011","author":"sala","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633620"},{"journal-title":"An efficient reconciliation algorithm for social networks","year":"2014","author":"korula","key":"ref20"},{"journal-title":"On your social network de-anonymizablity Quantification and large scale evaluation with seed knowledge NDSS","year":"2015","author":"ji","key":"ref22"},{"journal-title":"Structural Data De-anonymization Quantification Practice and Implications CCS","year":"2014","author":"ji","key":"ref21"},{"journal-title":"Stanford Large Network Dataset Collection","year":"0","key":"ref24"},{"journal-title":"The Google+ Dataset","year":"0","key":"ref23"},{"year":"0","key":"ref26"},{"journal-title":"ASU Social Computing Data Repository","year":"0","key":"ref25"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486356.pdf?arnumber=8486356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:58:44Z","timestamp":1598223524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486356","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}