{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T17:56:48Z","timestamp":1719251808802},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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":["World Wide Web"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11280-014-0290-4","type":"journal-article","created":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T03:55:42Z","timestamp":1401508542000},"page":"1481-1517","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Privacy preserving graph publication in a distributed environment"],"prefix":"10.1007","volume":"18","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","published-online":{"date-parts":[[2014,6,1]]},"reference":[{"key":"290_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the kth-ranked element. In: Avdances in Cryptology - Proceedings of Eurocyrpt 04, pp. 40\u201355. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_3"},{"key":"290_CR2","volume-title":"The Design and Analysis of Computer Algorithms, 1st edn","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley Longman, Boston (1974)"},{"key":"290_CR3","doi-asserted-by":"crossref","unstructured":"Andreev, K., R\u00e4ck, H. : Balanced graph partitioning. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201904, pp. 120\u2013124. ACM, New York (2004)","DOI":"10.1145\/1007912.1007931"},{"key":"290_CR4","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. 2, 766\u2013777 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"290_CR5","doi-asserted-by":"crossref","unstructured":"Campan, A., Truta, T.M.: A clustering approach for data and structural anonymity in social networks. In: PinKDD\u201908 (2008)","DOI":"10.1007\/978-3-642-01718-6_4"},{"key":"290_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: SDM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"290_CR7","first-page":"459","volume-title":"K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 International Conference on Management of Data SIGMOD \u201910","author":"J Cheng","year":"2010","unstructured":"Cheng, J., Fu, A.W.-c., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 International Conference on Management of Data SIGMOD \u201910, pp 459\u2013470. ACM, New York (2010)"},{"key":"290_CR8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M. Y.: Tools for privacy preserving distributed data mining. SIGKDD Explor. Newsl. 4, 28\u201334 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"290_CR9","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. 1, 833\u2013844 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"290_CR10","first-page":"13","volume-title":"Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms NSPW \u201901","author":"W Du","year":"2001","unstructured":"Du, W., Atallah, M. J.: Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms NSPW \u201901, pp 13\u201322. ACM, New York (2001)"},{"key":"290_CR11","first-page":"89","volume-title":"Private social network analysis: how to assemble pieces of a graph privately. In: Proceedings of the 5th ACM Workshop on Privacy in Electronic Society, WPES \u201906","author":"KB Frikken","year":"2006","unstructured":"Frikken, K. B., Golle, P.: Private social network analysis: how to assemble pieces of a graph privately. In: Proceedings of the 5th ACM Workshop on Privacy in Electronic Society, WPES \u201906, pp 89\u201398. ACM, New York (2006)"},{"key":"290_CR12","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":"290_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/1644893.1644931","volume-title":"Evolution of an online social aggregation network: an empirical study. In: Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement Conference, IMC \u201909","author":"S Garg","year":"2009","unstructured":"Garg, S., Gupta, T. , Carlsson, N., Mahanti, A.: Evolution of an online social aggregation network: an empirical study. In: Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement Conference, IMC \u201909, pp 315\u2013321. ACM, New York (2009)"},{"key":"290_CR14","first-page":"576","volume-title":"Movies recommendation networks as bipartite graphs. In: Proceedings of the 8th International Conference on Computational Science, Part II ICCS \u201908","author":"J Gruji\u0107","year":"2008","unstructured":"Gruji\u0107, J.: Movies recommendation networks as bipartite graphs. In: Proceedings of the 8th International Conference on Computational Science, Part II ICCS \u201908, pp 576\u2013583. Springer, Berlin (2008)"},{"key":"290_CR15","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. 1, 102\u2013114 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"290_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.datak.2007.06.014","volume":"65","author":"W Jiang","year":"2008","unstructured":"Jiang, W., Clifton, C., Kantarcioglu, M.: Transforming semi-honest protocols to ensure accountability. Data Knowl. Eng. 65, 57\u201374 (2008)","journal-title":"Data Knowl. Eng."},{"key":"290_CR17","first-page":"191","volume-title":"Distributed anonymization: achieving privacy for both data subjects and data providers. In: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on 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: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII, pp 191\u2013207. Springer, Berlin (2009)"},{"key":"290_CR18","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16, 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"290_CR19","first-page":"9","volume-title":"Privacy-preserving social network analysis for criminal investigations. In: Proceedings of the 7th ACM Workshop on Privacy in the Electronic Society, WPES \u201908","author":"F Kerschbaum","year":"2008","unstructured":"Kerschbaum, F., Schaad, A.: Privacy-preserving social network analysis for criminal investigations. In: Proceedings of the 7th ACM Workshop on Privacy in the Electronic Society, WPES \u201908, pp 9\u201314. ACM, New York (2008)"},{"key":"290_CR20","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD\u201908, pp. 93\u2013106 (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"290_CR21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/956750.956776","volume-title":"Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD \u201903","author":"J Vaidya","year":"2003","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD \u201903, pp 206\u2013215. ACM, New York (2003)"},{"key":"290_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MSP.2004.108","volume":"2","author":"J Vaidya","year":"2004","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving data mining: Why, how, and when. IEEE Secur. Priv. 2, 19\u201327 (2004)","journal-title":"IEEE Secur. Priv."},{"key":"290_CR23","doi-asserted-by":"crossref","unstructured":"Wasserman, S., G. Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"290_CR24","first-page":"160","volume-title":"Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science SFCS \u201982","author":"AC Yao","year":"1982","unstructured":"Yao, A. C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science SFCS \u201982, pp 160\u2013164. IEEE Computer Society, Washington (1982)"},{"key":"290_CR25","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: SDM\u201908 (2008)","DOI":"10.1137\/1.9781611972788.67"},{"key":"290_CR26","unstructured":"Yonglong, L., Liusheng, H., Yang, W., Weijiang, X.: An efficient protocol for private comparison problem. Chin. J. Electron., 18 (2009)"},{"key":"290_CR27","doi-asserted-by":"crossref","unstructured":"Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: PinKDD\u201907, pp. 153\u2013171 (2007)","DOI":"10.1007\/978-3-540-78478-4_9"},{"key":"290_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE\u201908, pp. 506\u2013515 (2008)","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"290_CR29","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. 2, 946\u2013957 (2009)","journal-title":"Proc. VLDB Endow."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0290-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-014-0290-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0290-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T01:03:23Z","timestamp":1565485403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-014-0290-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,1]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s11280-014-0290-4","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,1]]}}}