{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:00:31Z","timestamp":1780416031836,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T00:00:00Z","timestamp":1331251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s13278-012-0059-7","type":"journal-article","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T12:13:06Z","timestamp":1331208786000},"page":"151-166","source":"Crossref","is-referenced-by-count":47,"title":["Complexity of social network anonymization"],"prefix":"10.1007","volume":"3","author":[{"given":"Sean","family":"Chester","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gautam","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,9]]},"reference":[{"issue":"4","key":"59_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s13278-011-0018-8","volume":"1","author":"S Abdallah","year":"2011","unstructured":"Abdallah S (2011) Generalizing unweighted network measures to capture the focus in interactions. Soc Netw Anal Min 1(4):255\u2013269","journal-title":"Soc Netw Anal Min"},{"key":"59_CR2","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Proceedings of the international conference on database theory (ICDT), pp 246\u2013258"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich E, Karagiozova A (2007) Terminal backup, 3D matching, and covering cubic graphs. In: Proceedings of the ACM symposium on theory of computing (STOC), pp 391\u2013400","DOI":"10.1145\/1250790.1250849"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg JM (2007) Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the conference on World Wide Web (WWW), pp 181\u2013190","DOI":"10.1145\/1242572.1242598"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Blocki J, Williams R (2010) Resolving the complexity of some data privacy problems. In: Proceedings of the international colloquium on automata, languages and programming, pp 393\u2013404","DOI":"10.1007\/978-3-642-14162-1_33"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Bonizzoni P, Vedova GD, Dondi R (2009) The k-anonymity problem is hard. In: Fundamentals of computation theory (FCT), pp 26\u201337","DOI":"10.1007\/978-3-642-03409-1_4"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Cha M, P\u00e9rez J, Haddadi H (2011) The spread of media content through blogs. Soc Netw Anal Min 1\u201316. doi: 10.1007\/s13278-011-0040-x . Preprint","DOI":"10.1007\/s13278-011-0040-x"},{"key":"59_CR8","unstructured":"Chester S, Kapron B, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2011) k-Anonymization of social networks by vertex addition. In: Proceedings II of the advances in databases and information systems (ADBIS), pp 107\u2013116"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Chester S, Srivastava G (2011) Social network privacy for attribute disclosure attacks. In: Proceedings of the advances in social networks analysis and mining (ASONAM), pp 445\u2013449","DOI":"10.1109\/ASONAM.2011.105"},{"issue":"1","key":"59_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00778-009-0167-9","volume":"19","author":"G Cormode","year":"2010","unstructured":"Cormode G, Srivastava D, Yu T, Zhang Q (2010) Anonymizing bipartite graph data using safe groupings. Very Large Databases J (VLDBJ) 19(1):115\u2013139","journal-title":"Very Large Databases J (VLDBJ)"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Fung BCM, Wang K, Fu AWC, Pei J (2008) Anonymity for continuous data publishing. In: Proceedings of the international conference on extending database technology (EDBT), pp 264\u2013275","DOI":"10.1145\/1353343.1353378"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Gionis A, Tassa T (2007) k-Anonymization with minimal loss of information. In: Proceedings of the European symposium on algorithms (ESA), pp 439\u2013450","DOI":"10.1007\/978-3-540-75520-3_40"},{"issue":"1","key":"59_CR13","first-page":"102","volume":"1","author":"M Hay","year":"2008","unstructured":"Hay M, Miklau G, Jensen D, Towsley DF, Weis P (2008) Resisting structural re-identification in anonymized social networks. Proc Very Large Databases (PVLDB) 1(1):102\u2013114","journal-title":"Proc Very Large Databases (PVLDB)"},{"key":"59_CR14","doi-asserted-by":"crossref","unstructured":"Kapron B, Srivastava G, Venkatesh S (2011) Social network anonymization via edge addition. In: Proceedings of the advances in social networks analysis and mining (ASONAM), pp 155\u2013162","DOI":"10.1109\/ASONAM.2011.108"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Li N, Li T, Venkatasubramanian S (2007) t-Closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of the international conference on data engineering (ICDE), pp 106\u2013115","DOI":"10.1109\/ICDE.2007.367856"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: Proceedings of the ACM special interest group on management of data (SIGMOD), pp 93\u2013106","DOI":"10.1145\/1376616.1376629"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) l-Diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data (TKDD) 1(1). doi: 10.1145\/1217299.1217302","DOI":"10.1145\/1217299.1217302"},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: Proceedings of the principles of database systems (PODS), pp 223\u2013228","DOI":"10.1145\/1055558.1055591"},{"issue":"5","key":"59_CR19","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertain Fuzziness Knowl Based Syst 10(5):571\u2013588","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Thompson B, Yao D (2009) The union-split algorithm and cluster-based anonymization of social networks. In: Proceedings of the ACM symposium on information, computer and communications security (ASIACCS), pp 218\u2013227","DOI":"10.1145\/1533057.1533088"},{"key":"59_CR21","unstructured":"Tripathy BK, Panda GK (2010) A new approach to manage security against neighborhood attacks in social networks. In: Proceedings of the advances in social networks analysis and mining (ASONAM), pp 264\u2013269"},{"key":"59_CR22","doi-asserted-by":"crossref","unstructured":"Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) k-Symmetry model for identity anonymization in social networks. In: Proceedings of the international conference on extending database technology (EDBT), pp 111\u2013122","DOI":"10.1145\/1739041.1739058"},{"issue":"2","key":"59_CR23","first-page":"141","volume":"4","author":"M Yuan","year":"2010","unstructured":"Yuan M, Chen L, Yu PS (2010) Personalized privacy protection in social networks. Proc Very Large Databases (PVLDB) 4(2):141\u2013150","journal-title":"Proc Very Large Databases (PVLDB)"},{"key":"59_CR24","unstructured":"Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: Proceedings of the privacy, security, and trust in KDD (PinKDD), pp 153\u2013171"},{"issue":"1","key":"59_CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10115-010-0311-2","volume":"28","author":"B Zhou","year":"2011","unstructured":"Zhou B, Pei J (2011) The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowl Inf Syst 28(1):47\u201377","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"59_CR26","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13278-011-0021-0","volume":"1","author":"K Zweig","year":"2011","unstructured":"Zweig K, Kaufmann M (2011) A systematic approach to the one-mode projection of bipartite graphs. Soc Netw Anal Min 1(3):187\u2013218","journal-title":"Soc Netw Anal Min"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0059-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-012-0059-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-012-0059-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T02:46:57Z","timestamp":1561430817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-012-0059-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s13278-012-0059-7","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,9]]}}}