{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,26]],"date-time":"2026-10-26T17:07:00Z","timestamp":1793034420935,"version":"4.5.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links representing relations such as friendship, communication, or shared activity. Maintaining privacy when publishing networked data is uniquely challenging because an individual's network context can be used to identify them even if other identifying information is removed. In this paper, we quantify the privacy risks associated with three classes of attacks on the privacy of individuals in networks, based on the knowledge used by the adversary. We show that the risks of these attacks vary greatly based on network structure and size. We propose a novel approach to anonymizing network data that models aggregate network structure and then allows samples to be drawn from that model. The approach guarantees anonymity for network entities while preserving the ability to estimate a wide variety of network measures with relatively little bias.<\/jats:p>","DOI":"10.14778\/1453856.1453873","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T08:17:57Z","timestamp":1403597877000},"page":"102-114","source":"Crossref","is-referenced-by-count":344,"title":["Resisting structural re-identification in anonymized social networks"],"prefix":"10.14778","volume":"1","author":[{"given":"Michael","family":"Hay","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerome","family":"Miklau","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Jensen","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Weis","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"e_1_2_1_5_1","first-page":"286","article-title":"Emergence of scaling in random networks","author":"Barab\u00e1si A.","year":"1999","unstructured":"A. Barab\u00e1si and R. Albert . Emergence of scaling in random networks . Science , 286 , 1999 . A. Barab\u00e1si and R. Albert. Emergence of scaling in random networks. Science, 286, 1999.","journal-title":"Science"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2005-10574-3"},{"key":"e_1_2_1_7_1","volume-title":"Enron email dataset","author":"Cohen W. W.","year":"2005","unstructured":"W. W. Cohen . Enron email dataset , 2005 . W. W. Cohen. Enron email dataset, 2005."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/321556.321562"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_10_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s P.","year":"1960","unstructured":"P. Erd\u0151s and A. R\u00e9nyi . On the evolution of random graphs . Publ. Math. Inst. Hung. Acad. Sci , 5 : 17 -- 61 , 1960 . P. Erd\u0151s and A. R\u00e9nyi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5:17--61, 1960.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/sf\/62.1.54"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179601.1179619"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758222.1758229"},{"key":"e_1_2_1_15_1","volume-title":"Complexity Theory Retrospective","author":"Immerman N.","year":"1990","unstructured":"N. Immerman and E. Lander . Describing graphs: A first-order approach to graph canonization . In Complexity Theory Retrospective . Springer-Verlag , 1990 . N. Immerman and E. Lander. Describing graphs: A first-order approach to graph canonization. In Complexity Theory Retrospective. Springer-Verlag, 1990."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497554"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_19_1","volume-title":"ICDE","author":"Martin D.","year":"2007","unstructured":"D. Martin , D. Kifer , A. Machanavajjhala , J. Gehrke , and J. Halpern . Worst-case background knowledge . ICDE , 2007 . D. Martin, D. Kifer, A. Machanavajjhala, J. Gehrke, and J. Halpern. Worst-case background knowledge. ICDE, 2007."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1136\/sti.78.suppl_1.i159"},{"key":"e_1_2_1_22_1","volume-title":"VLDB","author":"Rastogi V.","year":"2007","unstructured":"V. Rastogi , S. Hong , and D. Suciu . The boundary between privacy and utility in data publishing . In VLDB , 2007 . V. Rastogi, S. Hong, and D. Suciu. The boundary between privacy and utility in data publishing. In VLDB, 2007."},{"key":"e_1_2_1_23_1","volume-title":"AI: A Modern Approach","author":"Russell S.","year":"2003","unstructured":"S. Russell and P. Norvig . AI: A Modern Approach . 2003 . S. Russell and P. Norvig. AI: A Modern Approach. 2003."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/GRC.2007.95"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_26_1","volume-title":"International Conference on Fuzzy Systems","author":"Wang D.-W.","year":"2006","unstructured":"D.-W. Wang , C.-J. Liau , and T.-S. Hsu . Privacy protection in social network data disclosure based on granular computing . In International Conference on Fuzzy Systems , 2006 . D.-W. Wang, C.-J. Liau, and T.-S. Hsu. Privacy protection in social network data disclosure based on granular computing. In International Conference on Fuzzy Systems, 2006."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_1_28_1","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2000","unstructured":"D. B. West . Introduction to Graph Theory . August 2000 . D. B. West. Introduction to Graph Theory. August 2000."},{"key":"e_1_2_1_29_1","volume-title":"SIAM Conf. on Data Mining","author":"Ying X.","year":"2007","unstructured":"X. Ying and X. Wu . Randomizing social networks: a spectrum preserving approach . In SIAM Conf. on Data Mining , 2007 . X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In SIAM Conf. on Data Mining, 2007."},{"key":"e_1_2_1_30_1","volume-title":"PinKDD Workshop","author":"Zheleva E.","year":"2007","unstructured":"E. Zheleva and L. Getoor . Preserving the privacy of sensitive relationships in graph data . In PinKDD Workshop , 2007 . E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In PinKDD Workshop, 2007."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1453856.1453873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T06:06:32Z","timestamp":1672207592000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453873"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453873","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}