{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T12:46:52Z","timestamp":1791377212151,"version":"4.3.2"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819605750","type":"print"},{"value":"9789819605767","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0576-7_1","type":"book-chapter","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T06:48:43Z","timestamp":1732603723000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving k-core Decomposition for Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6300-8386","authenticated-orcid":false,"given":"Xuyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0127-1001","authenticated-orcid":false,"given":"Rong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1402-4663","authenticated-orcid":false,"given":"Bingwen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7117-3951","authenticated-orcid":false,"given":"Jilian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Adcock, A.B., Sullivan, B.D., Mahoney, M.W.: Tree-like structure in large social and information networks. In: 2013 IEEE 13th International Conference on Data Mining, pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/ICDM.2013.77"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Assam, R., Hassani, M., Brysch, M., Seidl, T.: (k, d)-core anonymity: structural anonymization of massive networks. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management, pp. 1\u201312 (2014)","DOI":"10.1145\/2618243.2618269"},{"key":"1_CR3","unstructured":"Benaissa, A., Retiat, B., Cebere, B., Belfedhal, A.E.: Tenseal: a library for encrypted tensor operations using homomorphic encryption (2021)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Blelloch, G., Shun, J.: Julienne: a framework for parallel graph algorithms using work-efficient bucketing. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 293\u2013304 (2017)","DOI":"10.1145\/3087556.3087580"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Liu, Q.C., Raskhodnikova, S., Shi, J., Shun, J., Yu, S.: Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs. In: IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 754\u2013765. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00077"},{"issue":"11","key":"1_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888\u2013893 (2010)","journal-title":"Nat. Phys."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"537","DOI":"10.2478\/popets-2020-0040","volume":"2020","author":"VB Kukkala","year":"2020","unstructured":"Kukkala, V.B., Iyengar, S.: Identifying influential spreaders in a social network (while preserving privacy). Proc. Priv. Enhancing Technol. 2020(2), 537\u2013557 (2020)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"1_CR10","first-page":"612","volume":"23","author":"J Li","year":"2021","unstructured":"Li, J., Zhang, X., Liu, J., Gao, L., Zhang, H., Feng, Y.: Large-scale social network privacy protection method for protecting k-core. Int. J. Netw. Secur. 23, 612\u2013622 (2021)","journal-title":"Int. J. Netw. Secur."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.neucom.2022.11.083","volume":"521","author":"X Li","year":"2023","unstructured":"Li, X., Xu, L., Zhang, H., Xu, Q.: Differential privacy preservation for graph auto-encoders: a novel anonymous graph publishing model. Neurocomputing 521, 113\u2013125 (2023)","journal-title":"Neurocomputing"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lin, Y.H., Yang, D.N., Chen, W.T.: Privacy-preserving dense subgraph discovery in mobile social networks. In: 2015 IEEE Global Communications Conference (GLOBECOM), pp.\u00a01\u20137. IEEE (2015)","DOI":"10.1109\/GLOCOM.2015.7417824"},{"issue":"8","key":"1_CR13","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TKDE.2020.3033829","volume":"34","author":"J Liu","year":"2020","unstructured":"Liu, J., Xu, C., Yin, C., Wu, W., Song, Y.: K-core based temporal graph convolutional network for dynamic graphs. IEEE Trans. Knowl. Data Eng. 34(8), 3841\u20133853 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 93\u2013106 (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Medya, S., Ma, T., Silva, A., Singh, A.: A game theoretic approach for k-core minimization. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (2020)","DOI":"10.24963\/ijcai.2020\/480"},{"key":"1_CR16","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bring order to the web. Technical report, Stanford University (1998)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0576-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T08:27:52Z","timestamp":1732609672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0576-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,27]]},"ISBN":["9789819605750","9789819605767"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0576-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,27]]},"assertion":[{"value":"27 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Doha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qatar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","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":"wise2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2024-qatar.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}