{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:03Z","timestamp":1725489303601},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374005"},{"type":"electronic","value":"9783642374012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37401-2_10","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T00:03:25Z","timestamp":1363910605000},"page":"75-87","source":"Crossref","is-referenced-by-count":1,"title":["Privacy Preserving Graph Publication in a Distributed Environment"],"prefix":"10.1007","author":[{"given":"Mingxuan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Mei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"766","DOI":"10.14778\/1687627.1687714","volume":"2","author":"S. Bhagat","year":"2009","unstructured":"Bhagat, S., Cormode, G., Krishnamurthy, B., Srivastava, D.: Class-based graph anonymization for social network data. Proc. VLDB Endow.\u00a02, 766\u2013777 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR2","first-page":"459","volume-title":"SIGMOD 2010","author":"J. Cheng","year":"2010","unstructured":"Cheng, J., Fu, A.W.-C., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: SIGMOD 2010, pp. 459\u2013470. ACM, New York (2010)"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"833","DOI":"10.14778\/1453856.1453947","volume":"1","author":"G. Cormode","year":"2008","unstructured":"Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. Proc. VLDB Endow.\u00a01, 833\u2013844 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR4","first-page":"89","volume-title":"WPES 2006","author":"K.B. Frikken","year":"2006","unstructured":"Frikken, K.B., Golle, P.: Private social network analysis: how to assemble pieces of a graph privately. In: WPES 2006, pp. 89\u201398. ACM, New York (2006)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ganta, S.R., Kasiviswanathan, S., Smith, A.: Composition attacks and auxiliary information in data privacy. CoRR (2008)","DOI":"10.1145\/1401890.1401926"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Garg, S., Gupta, T., Carlsson, N., Mahanti, A.: Evolution of an online social aggregation network: an empirical study. In: IMC 2009, pp. 315\u2013321. ACM, New York (2009)","DOI":"10.1145\/1644893.1644931"},{"key":"10_CR7","doi-asserted-by":"crossref","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.: Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow.\u00a01, 102\u2013114 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR8","first-page":"9","volume-title":"WPES 2008","author":"F. Kerschbaum","year":"2008","unstructured":"Kerschbaum, F., Schaad, A.: Privacy-preserving social network analysis for criminal investigations. In: WPES 2008, pp. 9\u201314. ACM, New York (2008)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD 2008, pp. 93\u2013106 (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"10_CR10","first-page":"160","volume-title":"SFCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: SFCS 1982, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: SDM 2008 (2008)","DOI":"10.1137\/1.9781611972788.67"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-78478-4_9","volume-title":"Privacy, Security, and Trust in KDD","author":"E. Zheleva","year":"2008","unstructured":"Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: Bonchi, F., Malin, B., Sayg\u0131n, Y. (eds.) PinKDD 2007. LNCS, vol.\u00a04890, pp. 153\u2013171. Springer, Heidelberg (2008)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE 2008, pp. 506\u2013515 (2008)","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"10_CR14","doi-asserted-by":"crossref","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.\u00a02, 946\u2013957 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37401-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T18:32:11Z","timestamp":1557599531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37401-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374005","9783642374012"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37401-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}