{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:35:53Z","timestamp":1777520153010,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T00:00:00Z","timestamp":1556150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001866","name":"Fonds National de la Recherche Luxembourg","doi-asserted-by":"publisher","award":["C17\/IS\/11685812"],"award-info":[{"award-number":["C17\/IS\/11685812"]}],"id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10618-019-00631-5","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T17:04:44Z","timestamp":1556211884000},"page":"1357-1392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Robust active attacks on social graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Sjouke","family":"Mauw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-5756","authenticated-orcid":false,"given":"Yunior","family":"Ram\u00edrez-Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolando","family":"Trujillo-Rasua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,25]]},"reference":[{"key":"631_CR1","doi-asserted-by":"publisher","unstructured":"Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x? Anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th international conference on World Wide Web, New York, pp 181\u2013190. https:\/\/doi.org\/10.1145\/1242572.1242598","DOI":"10.1145\/1242572.1242598"},{"issue":"5439","key":"631_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"631_CR3","doi-asserted-by":"crossref","unstructured":"Bunke H (2000) Recent developments in graph matching. In: Proceedings of the 15th international conference on pattern recognition, pp 117\u2013124","DOI":"10.1109\/ICPR.2000.906030"},{"key":"631_CR4","doi-asserted-by":"crossref","unstructured":"Casas-Roma J, Herrera-Joancomart\u00ed J, Torra V (2013) An algorithm for k-degree anonymity on large networks. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 671\u2013675","DOI":"10.1145\/2492517.2492643"},{"issue":"2","key":"631_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10115-016-0947-7","volume":"50","author":"J Casas-Roma","year":"2017","unstructured":"Casas-Roma J, Herrera-Joancomart\u00ed J, Torra V (2017) k-degree anonymity and edge selection: improving data utility in large networks. Knowl Inf Syst 50(2):447\u2013474","journal-title":"Knowl Inf Syst"},{"key":"631_CR6","doi-asserted-by":"crossref","unstructured":"Cheng J, Fu AW, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp 459\u2013470","DOI":"10.1145\/1807167.1807218"},{"issue":"3","key":"631_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s13278-012-0084-6","volume":"3","author":"S Chester","year":"2013","unstructured":"Chester S, Kapron BM, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2013) Why waldo befriended the dummy? k-anonymization of social networks with pseudo-nodes. Soc Netw Anal Min 3(3):381\u2013399","journal-title":"Soc Netw Anal Min"},{"key":"631_CR8","doi-asserted-by":"crossref","unstructured":"Collberg C, Kobourov S, Carter E, Thomborson C (2003) Error-correcting graphs for software watermarking. In: Proceedings of the 29th workshop on graph theoretic concepts in computer science, pp 156\u2013167","DOI":"10.1007\/978-3-540-39890-5_14"},{"key":"631_CR9","doi-asserted-by":"crossref","unstructured":"Eppstein D, Goodrich MT, Lam J, Mamano N, Mitzenmacher M, Torres M (2016) Models and algorithms for graph watermarking. In: Proceedings of the international conference on information security, pp 283\u2013301","DOI":"10.1007\/978-3-319-45871-7_18"},{"key":"631_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ Math Debr 6:290\u2013297","journal-title":"Publ Math Debr"},{"key":"631_CR11","doi-asserted-by":"crossref","unstructured":"Fober T, Klebe G, H\u00fcllermeier E (2013) Local clique merging: an extension of the maximum common subgraph measure with applications in structural bioinformatics. In: Algorithms from and for nature and life. Springer, Berlin, pp 279\u2013286","DOI":"10.1007\/978-3-319-00035-0_28"},{"issue":"6","key":"631_CR12","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"issue":"1","key":"631_CR13","doi-asserted-by":"publisher","first-page":"102","DOI":"10.14778\/1453856.1453873","volume":"1","author":"M Hay","year":"2008","unstructured":"Hay M, Miklau G, Jensen D, Towsley D, Weis P (2008) Resisting structural re-identification in anonymized social networks. Proc VLDB Endow 1(1):102\u2013114. https:\/\/doi.org\/10.14778\/1453856.1453873","journal-title":"Proc VLDB Endow"},{"key":"631_CR14","unstructured":"Ji S, Li W, Mittal P, Hu X, Beyah RA (2015) Secgraph: a uniform and open-source evaluation system for graph data anonymization and de-anonymization. In: Proceedings of the 24th USENIX security symposium, pp 303\u2013318"},{"key":"631_CR15","doi-asserted-by":"crossref","unstructured":"Jorgensen Z, Yu T, Cormode G (2016) Publishing attributed social graphs with formal privacy guarantees. In: Proceedings of the 2016 international conference on management of data, pp 107\u2013122","DOI":"10.1145\/2882903.2915215"},{"key":"631_CR16","doi-asserted-by":"crossref","unstructured":"Karwa V, Slavkovi\u0107 AB (2012) Differentially private graphical degree sequences and synthetic graphs. In: Proceedings of the international conference on privacy in statistical databases, pp 273\u2013285","DOI":"10.1007\/978-3-642-33627-0_21"},{"key":"631_CR17","doi-asserted-by":"publisher","unstructured":"Liu C, Mittal P (2016) Linkmirage: enabling privacy-preserving analytics on social relationships. In: Proceedings of the network and distributed system security symposium. https:\/\/doi.org\/10.14722\/ndss.2016.23277","DOI":"10.14722\/ndss.2016.23277"},{"key":"631_CR18","doi-asserted-by":"publisher","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, New York, pp 93\u2013106. https:\/\/doi.org\/10.1145\/1376616.1376629","DOI":"10.1145\/1376616.1376629"},{"key":"631_CR19","doi-asserted-by":"crossref","unstructured":"Lu X, Song Y, Bressan S (2012) Fast identity anonymization on graphs. In: Proceedings of the international conference on database and expert systems applications, pp 281\u2013295","DOI":"10.1007\/978-3-642-32600-4_21"},{"issue":"12","key":"631_CR20","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1007\/s00607-015-0453-x","volume":"97","author":"T Ma","year":"2015","unstructured":"Ma T, Zhang Y, Cao J, Shen J, Tang M, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2015) KDVEM: a k-degree anonymity with vertex and edge modification algorithm. Computing 97(12):1165\u20131184","journal-title":"Computing"},{"key":"631_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.patrec.2015.05.003","volume":"62","author":"S Mallek","year":"2015","unstructured":"Mallek S, Boukhris I, Elouedi Z (2015) Community detection for graph-based similarity: application to protein binding pockets classification. Pattern Recogn Lett 62:49\u201354","journal-title":"Pattern Recogn Lett"},{"key":"631_CR22","unstructured":"Mauw S, Trujillo-Rasua R, Xuan B (2016) Counteracting active attacks in social network graphs. In: Proceedings of the 30th annual IFIP WG 11.3 conference on data and applications security and privacy, Lecture notes in computer science, vol 9766, pp 233\u2013248"},{"issue":"2","key":"631_CR23","first-page":"169","volume":"11","author":"S Mauw","year":"2018","unstructured":"Mauw S, Ram\u00edrez-Cruz Y, Trujillo-Rasua R (2018a) Anonymising social graphs in the presence of active attackers. Trans Data Priv 11(2):169\u2013198","journal-title":"Trans Data Priv"},{"key":"631_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1283-x","author":"S Mauw","year":"2018","unstructured":"Mauw S, Ram\u00edrez-Cruz Y, Trujillo-Rasua R (2018b) Conditional adjacency anonymity in social graphs under active attacks. Knowl Inf Syst. https:\/\/doi.org\/10.1007\/s10115-018-1283-x","journal-title":"Knowl Inf Syst"},{"key":"631_CR25","unstructured":"Mittal P, Papamanthou C, Song D (2013) Preserving link privacy in social network based systems. In: Proceedings of the network and distributed system security symposium"},{"key":"631_CR26","doi-asserted-by":"publisher","unstructured":"Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: Proceedings of the 30th IEEE symposium on security and privacy, pp 173\u2013187. https:\/\/doi.org\/10.1109\/SP.2009.22","DOI":"10.1109\/SP.2009.22"},{"issue":"5","key":"631_CR27","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1002\/asi.21015","volume":"60","author":"P Panzarasa","year":"2009","unstructured":"Panzarasa P, Opsahl T, Carley KM (2009) Patterns and dynamics of users\u2019 behavior and interaction: network analysis of an online community. J Assoc Inf Sci Technol 60(5):911\u2013932. https:\/\/doi.org\/10.1002\/asi.v60:5","journal-title":"J Assoc Inf Sci Technol"},{"key":"631_CR28","doi-asserted-by":"crossref","unstructured":"Peng W, Li F, Zou X, Wu J (2012) Seed and grow: an attack against anonymized social networks. In: Proceedings of the 9th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks, pp 587\u2013595","DOI":"10.1109\/SECON.2012.6275831"},{"issue":"2","key":"631_CR29","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TC.2012.202","volume":"63","author":"W Peng","year":"2014","unstructured":"Peng W, Li F, Zou X, Wu J (2014) A two-stage deanonymization attack against anonymized social networks. IEEE Trans Comput 63(2):290\u2013303. https:\/\/doi.org\/10.1109\/TC.2012.202","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"631_CR30","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10115-017-1064-y","volume":"54","author":"F Rousseau","year":"2017","unstructured":"Rousseau F, Casas-Roma J, Vazirgiannis M (2017) Community-preserving anonymization of graphs. Knowl Inf Syst 54(2):315\u2013343","journal-title":"Knowl Inf Syst"},{"key":"631_CR31","doi-asserted-by":"crossref","unstructured":"Sala A, Zhao X, Wilson C, Zheng H, Zhao BY (2011) Sharing graphs using differentially private graph models. In: Proceedings of the 2011 ACM SIGCOMM conference on internet measurement, pp 81\u201398","DOI":"10.1145\/2068816.2068825"},{"key":"631_CR32","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2015.03.005","volume":"188","author":"J Salas","year":"2015","unstructured":"Salas J, Torra V (2015) Graphic sequences, distances and k-degree anonymity. Discrete Appl Math 188:25\u201331","journal-title":"Discrete Appl Math"},{"issue":"6","key":"631_CR33","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027. https:\/\/doi.org\/10.1109\/69.971193","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"631_CR34","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu K (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern 13(3):353\u2013362. https:\/\/doi.org\/10.1109\/TSMC.1983.6313167","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"5","key":"631_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl-Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"631_CR36","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ins.2015.08.048","volume":"328","author":"R Trujillo-Rasua","year":"2016","unstructured":"Trujillo-Rasua R, Yero IG (2016) k-metric antidimension: a privacy measure for social graphs. Inf Sci 328:403\u2013417. https:\/\/doi.org\/10.1016\/j.ins.2015.08.048","journal-title":"Inf Sci"},{"key":"631_CR37","doi-asserted-by":"crossref","unstructured":"Varrette S, Bouvry P, Cartiaux H, Georgatos F (2014) Management of an academic HPC cluster: the UL experience. In: Proceedings of the 2014 international conference on high performance computing & simulation, Bologna, pp 959\u2013967","DOI":"10.1109\/HPCSim.2014.6903792"},{"issue":"3","key":"631_CR38","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s10115-013-0674-2","volume":"41","author":"Y Wang","year":"2014","unstructured":"Wang Y, Xie L, Zheng B, Lee KC (2014) High utility k-anonymization for social network publishing. Knowl Inf Syst 41(3):697\u2013725","journal-title":"Knowl Inf Syst"},{"issue":"6684","key":"631_CR39","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440","journal-title":"Nature"},{"key":"631_CR40","doi-asserted-by":"publisher","unstructured":"Xue M, Karras P, Ra\u00efssi C, Kalnis P, Pung HK (2012) Delineating social network data anonymization via random edge perturbation. In: Proceedings of the 21st ACM international conference on information and knowledge management, pp 475\u2013484. https:\/\/doi.org\/10.1145\/2396761.2396823","DOI":"10.1145\/2396761.2396823"},{"key":"631_CR41","doi-asserted-by":"crossref","unstructured":"Yu H, Kaminsky M, Gibbons PB, Flaxman A (2006) Sybilguard: defending against sybil attacks via social networks. In: Proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications, Pisa, pp 267\u2013278","DOI":"10.1145\/1159913.1159945"},{"key":"631_CR42","doi-asserted-by":"crossref","unstructured":"Yu H, Gibbons PB, Kaminsky M, Xiao F (2008) Sybillimit: a near-optimal social network defense against sybil attacks. In: Proceedings of the 2008 IEEE symposium on security and privacy, Oakland, pp 3\u201317","DOI":"10.1109\/SP.2008.13"},{"key":"631_CR43","doi-asserted-by":"crossref","unstructured":"Zhang J, Cormode G, Procopiuc CM, Srivastava D, Xiao X (2015) Private release of graph statistics using ladder functions. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 731\u2013745","DOI":"10.1145\/2723372.2737785"},{"key":"631_CR44","doi-asserted-by":"crossref","unstructured":"Zhao X, Liu Q, Zheng H, Zhao BY (2015) Towards graph watermarks. In: Proceedings of the 2015 ACM conference on online social networks, pp 101\u2013112","DOI":"10.1145\/2817946.2817956"},{"key":"631_CR45","doi-asserted-by":"publisher","unstructured":"Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the 2008 IEEE 24th international conference on data engineering, Washington, pp 506\u2013515. https:\/\/doi.org\/10.1109\/ICDE.2008.4497459","DOI":"10.1109\/ICDE.2008.4497459"},{"issue":"1","key":"631_CR46","doi-asserted-by":"publisher","first-page":"946","DOI":"10.14778\/1687627.1687734","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu MT (2009) K-automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946\u2013957. https:\/\/doi.org\/10.14778\/1687627.1687734","journal-title":"Proc VLDB Endow"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00631-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00631-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00631-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T02:02:35Z","timestamp":1694829755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00631-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,25]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["631"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00631-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,25]]},"assertion":[{"value":"26 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}