{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:31:28Z","timestamp":1769848288372,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030590123","type":"print"},{"value":"9783030590130","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59013-0_10","type":"book-chapter","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T10:03:03Z","timestamp":1599904983000},"page":"185-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Active Re-identification Attacks on Periodically Released Dynamic Social Graphs"],"prefix":"10.1007","author":[{"given":"Xihui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ema","family":"K\u00ebpuska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunior","family":"Ram\u00edrez-Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Modern Phys."},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/2043174.2043199","volume":"54","author":"L Backstrom","year":"2011","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. Commun. ACM 54(12), 133\u2013141 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"10_CR3","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.: k-degree anonymity and edge selection: improving data utility in large networks. Knowl. Inf. Syst. 50(2), 447\u2013474 (2017)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.ipm.2018.03.005","volume":"56","author":"N Dakiche","year":"2019","unstructured":"Dakiche, N., Tayeb, F.B., Slimani, Y., Benatchba, K.: Tracking community evolution in social networks: a survey. Inf. Process. Manag. 56(3), 1084\u20131102 (2019)","journal-title":"Inf. Process. Manag."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ding, X., Zhang, L., Wan, Z., Gu, M.: De-anonymizing dynamic social networks. In: Proceedings of GLOBECOM 2011, pp. 1\u20136 (2011)","DOI":"10.1109\/GLOCOM.2011.6133607"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ji, S., Li, W., Srivatsa, M., Beyah, R.: Structural data de-anonymization: quantification, practice, and implications. In: Proceedings of CCS 2014, pp. 1040\u20131053 (2014)","DOI":"10.1145\/2660267.2660278"},{"issue":"5","key":"10_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.14778\/2732269.2732274","volume":"7","author":"N Korula","year":"2014","unstructured":"Korula, N., Lattanzi, S.: An efficient reconciliation algorithm for social networks. Proc. VLDB Endow. 7(5), 377\u2013388 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Kumar, S., Spezzano, F., Subrahmanian, V.S., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: Proceedings of ICDM 2016, pp. 221\u2013230 (2016)","DOI":"10.1109\/ICDM.2016.0033"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection. In: Proceedings of WWW 2013, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of SIGMOD 2008, pp. 93\u2013106 (2008)","DOI":"10.1145\/1376616.1376629"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, V., Berzal, F., Cubero, J.C.: A survey of link prediction in complex networks. ACM Comput. Surv. 49(4), 69 (2017)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10_CR12","first-page":"169","volume":"11","author":"S Mauw","year":"2018","unstructured":"Mauw, S., Ram\u00edrez-Cruz, Y., Trujillo-Rasua, R.: Anonymising social graphs in the presence of active attackers. Trans. Data Privacy 11(2), 169\u2013198 (2018)","journal-title":"Trans. Data Privacy"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10115-018-1283-x","volume":"61","author":"S Mauw","year":"2018","unstructured":"Mauw, S., Ram\u00edrez-Cruz, Y., Trujillo-Rasua, R.: Conditional adjacency anonymity in social graphs under active attacks. Knowl. Inf. Syst. 61(1), 485\u2013511 (2018). https:\/\/doi.org\/10.1007\/s10115-018-1283-x","journal-title":"Knowl. Inf. Syst."},{"issue":"5","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s10618-019-00631-5","volume":"33","author":"S Mauw","year":"2019","unstructured":"Mauw, S., Ram\u00edrez-Cruz, Y., Trujillo-Rasua, R.: Robust active attacks on social graphs. Data Mining Knowl. Discov. 33(5), 1357\u20131392 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00631-5","journal-title":"Data Mining Knowl. Discov."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: Proceedings of S&P 2009, pp. 173\u2013187 (2009)","DOI":"10.1109\/SP.2009.22"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Nilizadeh, S., Kapadia, A., Ahn, Y.: Community-enhanced de-anonymization of online social networks. In: Proceedings of CCS 2014, pp. 537\u2013548 (2014)","DOI":"10.1145\/2660267.2660324"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"012322","DOI":"10.1103\/PhysRevE.99.012322","volume":"99","author":"F Papadopoulos","year":"2019","unstructured":"Papadopoulos, F., Kleineberg, K.K.: Link persistence and conditional distances in multiplex networks. Phys. Rev. E 99(1), 012322 (2019)","journal-title":"Phys. Rev. E"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Pedarsani, P., Figueiredo, D.R., Grossglauser, M.: A Bayesian method for matching two similar graphs without seeds. In: Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, pp. 1598\u20131607 (2013)","DOI":"10.1109\/Allerton.2013.6736720"},{"issue":"2","key":"10_CR19","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.: A two-stage deanonymization attack against anonymized social networks. IEEE Trans. Comput. 63(2), 290\u2013303 (2014)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10_CR20","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.: Community-preserving anonymization of graphs. Knowl. Inf. Syst. 54(2), 315\u2013343 (2017). https:\/\/doi.org\/10.1007\/s10115-017-1064-y","journal-title":"Knowl. Inf. Syst."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Tai, C.H., Tseng, P.J., Philip, S.Y., Chen, M.S.: Identities anonymization in dynamic social networks. In: Proceedings of ICDM 2011, pp. 1224\u20131229 (2011)","DOI":"10.1109\/ICDM.2011.78"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: K-symmetry model for identity anonymization in social networks. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 111\u2013122 (2010)","DOI":"10.1145\/1739041.1739058"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Yartseva, L., Grossglauser, M.: On the performance of percolation graph matching. In: Proceedings of COSN 2013, pp. 119\u2013130 (2013)","DOI":"10.1145\/2512938.2512952"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: Sybillimit: a near-optimal social network defense against sybil attacks. In: Procs. of S&P 2008. pp. 3\u201317 (2008)","DOI":"10.1109\/SP.2008.13"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: SybilQuard: defending against sybil attacks via social networks. In: Proceedings of SIGCOMM 2006, pp. 267\u2013278 (2006)","DOI":"10.1145\/1159913.1159945"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: Proceedings of ICDE 2008, pp. 506\u2013515 (2008)","DOI":"10.1109\/ICDE.2008.4497459"},{"issue":"1","key":"10_CR27","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, M.T.: K-automorphism: a general framework for privacy preserving network publication. Proc. VLDB Endow. 2(1), 946\u2013957 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59013-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:04:32Z","timestamp":1757628272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59013-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590123","9783030590130"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59013-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guildford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/esorics2020.sccs.surrey.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"366","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9,1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-10 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}