{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T03:30:24Z","timestamp":1775446224089,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>The growing popularity of social networks has generated interesting data management and data mining problems. An important concern in the release of these data for study is their privacy, since social networks usually contain personal information. Simply removing all identifiable personal information (such as names and social security number) before releasing the data is insufficient. It is easy for an attacker to identify the target by performing different structural queries. In this paper we propose k-automorphism to protect against multiple structural attacks and develop an algorithm (called KM) that ensures k-automorphism. We also discuss an extension of KM to handle \"dynamic\" releases of the data. Extensive experiments show that the algorithm performs well in terms of protection it provides.<\/jats:p>","DOI":"10.14778\/1687627.1687734","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"946-957","source":"Crossref","is-referenced-by-count":279,"title":["k-automorphism"],"prefix":"10.14778","volume":"2","author":[{"given":"Lei","family":"Zou","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Y. Bu A. W.-C. Fu R. C.-W. Wong L. C. 0002 and J. Li. Privacy preserving serial data publishing by role composition. PVLDB 1(1).   Y. Bu A. W.-C. Fu R. C.-W. Wong L. C. 0002 and J. Li. Privacy preserving serial data publishing by role composition. PVLDB 1(1).","DOI":"10.14778\/1453856.1453948"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"G. Cormode D. Srivastava T. Yu and Q. Zhang. Anonymizing bipartite graph data using safe groupings. PVLDB 1(1).   G. Cormode D. Srivastava T. Yu and Q. Zhang. Anonymizing bipartite graph data using safe groupings. PVLDB 1(1).","DOI":"10.14778\/1453856.1453947"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179601.1179619"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"key":"e_1_2_1_8_1","volume-title":"University of Massachusetts Amherst","author":"Hay M.","year":"2007"},{"key":"e_1_2_1_9_1","volume-title":"ICDE","author":"Jr R. J. B.","year":"2005"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_2_1_12_1","unstructured":"J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction. Cambirdge University Press.  J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction . Cambirdge University Press."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275508"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_17_1","author":"Wang H.","year":"2008","journal-title":"Journal of Systems Science and Complexity"},{"key":"e_1_2_1_18_1","volume-title":"VLDB","author":"Xiao X.","year":"2006"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247556"},{"issue":"6","key":"e_1_2_1_20_1","volume":"77","author":"Xiao Y.","year":"2008","journal-title":"Emergence of symmetry in complex networks. Physical Review E"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60044-2_58"},{"key":"e_1_2_1_23_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\/1687627.1687734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:33:58Z","timestamp":1672227238000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687734"}},"subtitle":["a general framework for privacy preserving network publication"],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687734"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687734","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}