{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:33:53Z","timestamp":1743096833637,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811518980"},{"type":"electronic","value":"9789811518997"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-981-15-1899-7_14","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T16:02:38Z","timestamp":1574870558000},"page":"194-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Graph Perturbation Algorithm on Social Networks with Reachability Preservation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8046-650X","authenticated-orcid":false,"given":"Xiaolin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1429-8667","authenticated-orcid":false,"given":"Jian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9800-3829","authenticated-orcid":false,"given":"Xiaoyu","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2984-3197","authenticated-orcid":false,"given":"Jiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Backstrom, L, Dwork, C.: Kleinberg, J.: Wherefore art thou r3579x? anonymized social networks, hidden patterns, and structural steganography. In: 16th International Conference on World Wide Web on Proceedings, pp. 181\u2013190. ACM, Canada (2007)","DOI":"10.1145\/1242572.1242598"},{"key":"14_CR2","unstructured":"Hay, M., Miklau, G., Jensen, D.: Anonymizing social networks. Computer science department faculty publication series, pp. 173\u2013187 (2007)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Ying, X.W., Wu, X.T.: Randomizing social networks: a spectrum preserving approach. In: 8th SIAM International Conference on Data Mining on Proceedings, pp. 739\u2013750. Industrial and Applied Mathematics, United States (2008)","DOI":"10.1137\/1.9781611972788.67"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-01307-2_6","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X Ying","year":"2009","unstructured":"Ying, X., Wu, X.: On link privacy in randomizing social networks. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 28\u201339. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-01307-2_6"},{"key":"14_CR5","unstructured":"Fu, L.Z., Meng, X.F.: Reachability indexing for large-scale graphs: studies and forecasts. J. Comput. Res. Dev. 2(1), 116\u2013129 (2015)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S.: FERRARI: flexible and efficient reachability range assignment for graph indexing. In IEEE 29th International Conference on Data Engineering on Proceedings, pp. 1009\u20131020. IEEE, Brisbane (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-013-0346-6","volume":"23","author":"J Cheng","year":"2014","unstructured":"Cheng, J., Shang, Z., Cheng, H.: Efficient processing of k-hop reachability queries. VLDB 23(2), 227\u2013252 (2014)","journal-title":"VLDB"},{"key":"14_CR8","unstructured":"Zhou, J.F., Chen, W., Fei, C, P.: BiRch: a bidirectional search algorithm for k-step reachability queries. Communications 36(8), 50\u201360 (2015)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-03007-9_13","volume-title":"Data and Applications Security XXIII","author":"P Jurczyk","year":"2009","unstructured":"Jurczyk, P., Xiong, L.: Distributed anonymization: achieving privacy for both data subjects and data providers. In: Gudes, E., Vaidya, J. (eds.) DBSec 2009. LNCS, vol. 5645, pp. 191\u2013207. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03007-9_13"},{"issue":"8","key":"14_CR10","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1109\/TC.2014.2360516","volume":"64","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Dou, W., Pei, J.: Proximity-aware local-recoding anonymization with MapReduce for scalable big data privacy preservation in cloud. IEEE Trans. Comput. 64(8), 2293\u20132307 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR11","unstructured":"Zhang, X,. Yang, L, T., Liu, C.: A scalable two-phase top-down specialization approach for data anonymization using MapReduce on cloud. IEEE Trans. Parallel Distrib. Syst. 25(2), 363\u2013373 (2014)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Fard, A.M., Wang, K., Yu, P.S.: Limiting link disclosure in social network analysis through subgraph-wise perturbation. In: 15th International Conference on Extending Database Technology on Proceedings, pp. 109\u2013119, ACM, New York (2012)","DOI":"10.1145\/2247596.2247610"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Fard, A.M., Wang, K.: Neighborhood randomization for link privacy in social network analysis. World Wide Web 18(1), 9\u201332 (2015)","DOI":"10.1007\/s11280-013-0240-6"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"766","DOI":"10.14778\/1687627.1687714","volume":"2","author":"S Bhagat","year":"2009","unstructured":"Bhagat, S., Cormode, G., Krishnamurthy, B.: Class-based graph anonymization for social network data. VLDB Endow. 2(1), 766\u2013777 (2009)","journal-title":"VLDB Endow."},{"issue":"07","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1142\/S0218194014500363","volume":"24","author":"L Wang","year":"2017","unstructured":"Wang, L., Li, X.: A clustering-based bipartite graph privacy preserving approach for sharing high-dimensional data. Int. J. Softw. Eng. Knowl. Eng. 24(07), 1091\u20131111 (2017)","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zheng, B.: Preserving privacy in social networks against connection fingerprint attacks. In: IEEE 31st International Conference on Data Engineering on Proceedings, pp. 54\u201365. IEEE, Seoul (2015)","DOI":"10.1109\/ICDE.2015.7113272"},{"issue":"6","key":"14_CR17","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1109\/TDSC.2012.65","volume":"9","author":"A Masoumzadeh","year":"2012","unstructured":"Masoumzadeh, A., Joshi, J.: Preserving structural properties in edge-perturbing anonymization techniques for social networks. IEEE Trans. Dependable Secure Comput. 9(6), 877\u2013889 (2012)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Masoumzadeh, A., Joshi, J.: Preserving structural properties in anonymization of social networks. In: 6th International Conference on Collaborative Computing: Networking Applications and Worksharing on Proceedings, pp. 1\u201310. IEEE, Chicago (2011)","DOI":"10.4108\/icst.collaboratecom.2010.7"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, L., Zhang, W.: Edge anonymity in social network graphs. In: Proceedings International Conference on Computational Science & Engineering, pp. 1\u20138. IEEE, Vancouver (2009)","DOI":"10.1109\/CSE.2009.310"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-12054-6_18","volume-title":"Modeling Decisions for Artificial Intelligence","author":"J Casas-Roma","year":"2014","unstructured":"Casas-Roma, J.: Privacy-preserving on graphs using randomization and edge-relevance. In: Torra, V., Narukawa, Y., Endo, Y. (eds.) MDAI 2014. LNCS (LNAI), vol. 8825, pp. 204\u2013216. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-12054-6_18"},{"key":"14_CR21","unstructured":"Mittal, P., Papamanthou, C., Song, D.: Preserving Link Privacy in Social Network Based Systems. arXiv preprint \narXiv:1208.6189\n\n (2012)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Liu, C., Mittal, P.: LinkMirage: enabling privacy-preserving analytics on social relationships. In: Network & Distributed System Security Symposium on Proceedings (2016)","DOI":"10.14722\/ndss.2016.23277"},{"key":"14_CR23","unstructured":"Liu, C., Mittal, P.: LinkMirage: How to Anonymize Links in Dynamic Social Systems. Eprint \narXiv:1501.01361\n\n (2015)"},{"key":"14_CR24","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A.: Graphx: graph processing in a distributed dataflow framework. In: Usenix Conference on Operating Systems Design & Implementation on Proceedings, pp. 599\u2013613 (2014)"},{"key":"14_CR25","unstructured":"Xin, R.S., Crankshaw, D., Dave, A.: GraphX: unifying data-parallel and graph-parallel analytics. arXiv preprint \narXiv:1402.2394\n\n (2014)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J.: GraphX: a resilient distributed graph system on Spark. In: First International Workshop on Graph Data Management Experiences and Systems on Proceedings. ACM, 2 (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Daly, E., Haahr, M.: Social network analysis for information flow in disconnected delay-tolerant MANETs. IEEE Trans. Mob. Comput. 8(5), 621 (2009)","DOI":"10.1109\/TMC.2008.161"}],"container-title":["Communications in Computer and Information Science","Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-1899-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T21:03:33Z","timestamp":1574888613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-1899-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811518980","9789811518997"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-1899-7_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BigData","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigdat2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grid.hust.edu.cn\/bigdata2019","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":"324","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":"30","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":"9% - 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":"3","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)"}}]}}