{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:08:55Z","timestamp":1742962135876,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819712731"},{"type":"electronic","value":"9789819712748"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-1274-8_19","type":"book-chapter","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T19:20:02Z","timestamp":1710271202000},"page":"289-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Probability Mapping-Based Privacy Preservation Method for Social Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2532-045X","authenticated-orcid":false,"given":"Qingru","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4906-4846","authenticated-orcid":false,"given":"Yahong","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3888-8167","authenticated-orcid":false,"given":"Fangwei","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5420-2554","authenticated-orcid":false,"given":"Zhiyuan","family":"Tan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2054-9215","authenticated-orcid":false,"given":"Changguang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,13]]},"reference":[{"issue":"05","key":"19_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: K-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(05), 557\u2013570 (2002). https:\/\/doi.org\/10.1142\/S0218488502001648","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A Machanavajjhala","year":"2007","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Muthuramakrishnan, V.: L-diversity: privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data (TKDD) 1(1), 1\u201352 (2007). https:\/\/doi.org\/10.1145\/1217299.1217302","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: T-Closeness: privacy beyond k-anonymity and l-diversity. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 106\u2013115 (2006)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: M-invariance: towards privacy preserving re-publication of dynamic datasets. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 689\u2013700 (2007)","DOI":"10.1145\/1247480.1247556"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TKDE.2021.3073062","volume":"35","author":"H Jiang","year":"2021","unstructured":"Jiang, H., Pei, J., Yu, D., Yu, J., Gong, B., Cheng, X.: Applications of differential privacy in social network analysis: a survey. IEEE Trans. Knowl. Data Eng. 35(1), 108\u2013127 (2021). https:\/\/doi.org\/10.1109\/TKDE.2021.3073062","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Automata, Languages and Programming. ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1","DOI":"10.1007\/11787006_1"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/7206179","volume":"2021","author":"T Lv","year":"2021","unstructured":"Lv, T., Li, H., Tang, Z., Fu, F., Cao, J., Zhang, J.: Publishing triangle counting histogram in social networks based on differential privacy. Secur. Commun. Netw. 2021, 1\u201316 (2021). https:\/\/doi.org\/10.1155\/2021\/7206179","journal-title":"Secur. Commun. Netw."},{"issue":"12","key":"19_CR8","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.3390\/sym14122531","volume":"14","author":"N Zhou","year":"2022","unstructured":"Zhou, N., Long, S., Liu, H.: Structure-attribute social network graph data publishing satisfying differential privacy. Symmetry 14(12), 2531\u20132541 (2022)","journal-title":"Symmetry"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/TNSM.2020.2982555","volume":"17","author":"H Huang","year":"2020","unstructured":"Huang, H., Zhang, D., Xiao, F., Wang, K., Gu, J., Wang, R.: Privacy-preserving approach PBCN in social network with differential privacy. IEEE Trans. Netw. Serv. Manag. 17(2), 931\u2013945 (2020). https:\/\/doi.org\/10.1109\/TNSM.2020.2982555","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"23","key":"19_CR10","doi-asserted-by":"publisher","first-page":"185276","DOI":"10.1109\/ACCESS.2020.3026008","volume":"8","author":"T Gao","year":"2020","unstructured":"Gao, T., Li, F.: Protecting social network with differential privacy under novel graph model. IEEE Access 8(23), 185276\u2013185289 (2020)","journal-title":"IEEE Access"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Day, W.Y., Li, N., Min, L.: Publishing graph degree distribution with node differential privacy. In: Proceedings of the 2016 International Conference on Management of Data, pp. 123\u2013138 (2016)","DOI":"10.1145\/2882903.2926745"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"508","DOI":"10.7544\/issn1000-1239.2019.20170886","volume":"56","author":"Y Zhang","year":"2019","unstructured":"Zhang, Y., Wei, J., Li, J.: Graph degree histogram publication method with node-differential privacy. J. Comput. Res. Dev. 56(3), 508\u2013520 (2019). https:\/\/doi.org\/10.7544\/issn1000-1239.2019.20170886","journal-title":"J. Comput. Res. Dev."},{"issue":"23","key":"19_CR13","doi-asserted-by":"publisher","first-page":"217642","DOI":"10.1109\/ACCESS.2020.3040077","volume":"8","author":"G Liu","year":"2020","unstructured":"Liu, G., Ma, X., Li, W.: Publishing node strength distribution with node differential privacy. IEEE Access 8(23), 217642\u2013217650 (2020)","journal-title":"IEEE Access"},{"issue":"11","key":"19_CR14","doi-asserted-by":"publisher","first-page":"5278","DOI":"10.1109\/TKDE.2021.3052827","volume":"34","author":"X Ding","year":"2021","unstructured":"Ding, X., et al.: Differential private triangle counting in large graphs. IEEE Trans. Knowl. Data Eng. 34(11), 5278\u20135292 (2021). https:\/\/doi.org\/10.1109\/TKDE.2021.3052827","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR15","unstructured":"Sofya, R., Adam, S.: Efficient Lipschitz extensions for high-dimensional graph statistics and node private degree distributions (2015). arXiv preprint arXiv:1504.07912"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.future.2021.09.015","volume":"127","author":"X Wu","year":"2022","unstructured":"Wu, X., Zhang, Y., Shi, M., Li, P., Li, R., Xiong, N.: An adaptive federated learning scheme with differential privacy preserving. Futur. Gener. Comput. Syst. 127(1), 362\u2013372 (2022). https:\/\/doi.org\/10.1016\/j.future.2021.09.015","journal-title":"Futur. Gener. Comput. Syst."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"11817","DOI":"10.1109\/ACCESS.2022.3144084","volume":"8","author":"OT Odeyomi","year":"2022","unstructured":"Odeyomi, O.T.: Differential privacy in social networks using multi-armed bandit. IEEE Access 8, 11817\u201311829 (2022)","journal-title":"IEEE Access"},{"key":"19_CR18","unstructured":"Jure, L., Andrej, K.: June 2014. http:\/\/snap.stanford.edu\/data"}],"container-title":["Communications in Computer and Information Science","Ubiquitous Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-1274-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T19:22:48Z","timestamp":1710271368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-1274-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819712731","9789819712748"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-1274-8_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UbiSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Ubiquitous Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Exeter","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ubisec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpcn.exeter.ac.uk\/ubisec2023\/","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":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","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":"29","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":"32% - 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","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}