{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:00:08Z","timestamp":1774990808108,"version":"3.50.1"},"reference-count":61,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/allerton.2019.8919967","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"487-494","source":"Crossref","is-referenced-by-count":3,"title":["Improving Privacy in Graphs Through Node Addition"],"prefix":"10.1109","author":[{"given":"Nazanin","family":"Takbiri","sequence":"first","affiliation":[{"name":"UMass-Amherst,Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhe","family":"Shao","sequence":"additional","affiliation":[{"name":"UMass-Amherst,Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixin","family":"Gao","sequence":"additional","affiliation":[{"name":"UMass-Amherst,Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Pishro-Nik","sequence":"additional","affiliation":[{"name":"UMass-Amherst,Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869137"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/sec.840"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807218"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1145\/1150402.1150499","article-title":"(?k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing","author":"wong","year":"2006","journal-title":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446983"},{"key":"ref35","first-page":"3513","article-title":"Seeded graph matching for correlated erd&#x00F6;s-r&#x00E9;nyi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref60","year":"0","journal-title":"Routing information service"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.11"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-009-9163-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401945"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"ref20","first-page":"88","article-title":"Preserving privacy in social networks based on d-neighborhood subgraph anonymity","author":"jin","year":"2011","journal-title":"Application Research of Computers"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.4156\/jcit.vol8.issue2.8","article-title":"d, k-anonymity for social networks publication against neighborhood attacks","volume":"8","author":"wu","year":"2013","journal-title":"JCIT Journal of Convergence Information Technology"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref23","first-page":"180","article-title":"Anonymizing social networks","author":"hay","year":"2007","journal-title":"Computer Science Department Faculty Publication Series"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316669846","volume":"432","author":"lauri","year":"2016","journal-title":"Topics in Graph Automorphisms and Reconstruction"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"},{"key":"ref50","volume":"102","author":"beineke","year":"2004","journal-title":"Topics in Algebraic Graph Theory"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873134"},{"key":"ref59","year":"0","journal-title":"Route Views"},{"key":"ref58","doi-asserted-by":"crossref","DOI":"10.1201\/9781420057140","author":"gross","year":"2005","journal-title":"Graph Theory and its Applications"},{"key":"ref57","author":"ji","year":"2016","journal-title":"Evaluating the security of anonymized big graph\/structural data"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486356"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660324"},{"key":"ref54","first-page":"41","article-title":"Towards an information theoretic metric for anonymity","author":"serjantov","year":"2002","journal-title":"International Workshop on Privacy Enhancing Technologies"},{"key":"ref53","first-page":"54","article-title":"Towards measuring anonymity","author":"diaz","year":"2002","journal-title":"International Workshop on Privacy Enhancing Technologies"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2713341"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633620"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref40","article-title":"Network alignment: Theory, algorithms, and applications","author":"kazemi","year":"2016","journal-title":"EPFL Tech Rep"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"ref13","article-title":"Structural data deanonymization: Quantification, practice, and implications","author":"ji","year":"2014","journal-title":"ACM Conference on Computer and Communications Security"},{"key":"ref14","article-title":"Structure based data de-anonymization of social networks and mobility traces","author":"ji","year":"2014","journal-title":"ISC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23096"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6515-8_13"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3331076.3331081"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066165"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382262"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0033"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00253-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663743"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48899-7_9"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218436"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555375"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/90.974527","article-title":"On inferring autonomous system relationships in the internet","volume":"9","author":"gao","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2529591"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863963"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316231"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919967.pdf?arnumber=8919967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:44Z","timestamp":1774986704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919967","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}