{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:53:17Z","timestamp":1760597597087},"reference-count":29,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>One is either on Facebook or not. Of course, this assessment is controversial and its rationale arguable. It is nevertheless not far, for many, from the reason behind joining social media and publishing and sharing details of their professional and private lives. Not only the personal details that may be revealed, but also the structure of the networks are sources of invaluable information for any organization wanting to understand and learn about social groups, their dynamics and members. These organizations may or may not be benevolent. It is important to devise, design and evaluate solutions that guarantee some privacy. One approach that reconciles the different stakeholders\u2019 requirement is the publication of a modified graph. The perturbation is hoped to be sufficient to protect members\u2019 privacy while it maintains sufficient utility for analysts wanting to study the social media as a whole. In this paper, the authors try to empirically quantify the inevitable trade-off between utility and privacy. They do so for two state-of-the-art graph anonymization algorithms that protect against most structural attacks, the k-automorphism algorithm and the k-degree anonymity algorithm. The authors measure several metrics for a series of real graphs from various social media before and after their anonymization under various settings.<\/p>","DOI":"10.4018\/jaras.2013040101","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T12:55:30Z","timestamp":1379336130000},"page":"1-34","source":"Crossref","is-referenced-by-count":4,"title":["On the Privacy and Utility of Anonymized Social Networks"],"prefix":"10.4018","volume":"4","author":[{"given":"Yi","family":"Song","sequence":"first","affiliation":[{"name":"Department of Computer Science, School of Computing, National University of Singapore, Singapore"}]},{"given":"Xuesong","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, School of Computing, National University of Singapore, Singapore"}]},{"given":"Sadegh","family":"Nobari","sequence":"additional","affiliation":[{"name":"Department of Computer Science, School of Computing, National University of Singapore, Singapore"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, School of Computing, National University of Singapore, Singapore"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Department of Management Science & Information Systems, Rutgers Business School, Rutgers University, Newark, NJ, USA"}]}],"member":"2432","reference":[{"key":"jaras.2013040101-0","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Dwork, C., & Kleinberg, J. (2007). Wherefore art thou {R3579X}? Anonymized social networks, hidden patterns, and structural steganography. In Proceedings of the 16th international conference on World Wide Web (pp. 181-190). Banff, Alberta, Canada: ACM.","DOI":"10.1145\/1242572.1242598"},{"key":"jaras.2013040101-1","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Cormode, G., Krishnamurthy, B., & Srivastava, D. (2009). Class-based graph anonymization for social network data. In Proceedings of the VLDB Endowment (pp. 766-777).","DOI":"10.14778\/1687627.1687714"},{"key":"jaras.2013040101-2","doi-asserted-by":"crossref","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. WWW. Brisbane, Australia.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"jaras.2013040101-3","doi-asserted-by":"crossref","unstructured":"Campan, A., & Truta, T. M. (2008). A clustering approach for data and structural anonymity in social networks. In Proceedings of the 2nd ACM SIGKDD International Workshop on Privacy, Security, and Trust in KDD. Las Vegas, NV: ACM.","DOI":"10.1007\/978-3-642-01718-6_4"},{"key":"jaras.2013040101-4","doi-asserted-by":"crossref","unstructured":"Cheng, J., Fu, A. W.-C., & Liu, J. (2010). K-isomorphism: Privacy preserving network publication against structural attacks. In Proceedings of the 2010 International Conference on Management of Data (pp. 459--470). Indianapolis, IN: ACM.","DOI":"10.1145\/1807167.1807218"},{"key":"jaras.2013040101-5","author":"F.Chung","year":"1997","journal-title":"Spectral graph theory"},{"key":"jaras.2013040101-6","doi-asserted-by":"crossref","unstructured":"Clauset, A., Shalizi, C. R., & Newman, M. E. (2009). Power-law distributions in empirical data. SIAM, 661-703.","DOI":"10.1137\/070710111"},{"key":"jaras.2013040101-7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0167-9"},{"key":"jaras.2013040101-8","unstructured":"Dimitrios, K. (2010). Greek construction firms formation and topological analysis of a collaboration network. International Research Journal of Finance and Economics, 168-177."},{"key":"jaras.2013040101-9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"jaras.2013040101-10","doi-asserted-by":"crossref","unstructured":"Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008). Resisting structural re-identification in anonymized social networks. In Proceedings of the VLDB Endowment (pp. 102-114). VLDB Endowment.","DOI":"10.14778\/1453856.1453873"},{"key":"jaras.2013040101-11","unstructured":"Hay, M., Miklau, G., Jensen, D., Weis, P., & Srivastava, S. (2007). Anonymizing social networks."},{"key":"jaras.2013040101-12","author":"R.Kumar","year":"2006","journal-title":"Structure and evolution of online social networks. KDD"},{"key":"jaras.2013040101-13","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"jaras.2013040101-14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010). Predicting positive and negative links in online social networks. Proceedings of the 19th International Conference on World Wide Web (pp. 641--650). Raleigh, North Carolina: ACM.","DOI":"10.1145\/1772690.1772756"},{"key":"jaras.2013040101-15","doi-asserted-by":"crossref","unstructured":"Liu, K., & Terzi, E. (2008). Towards identity anonymization on graphs. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (pp. 93--106). Vancouver, Canada: ACM.","DOI":"10.1145\/1376616.1376629"},{"key":"jaras.2013040101-16","doi-asserted-by":"crossref","unstructured":"Liu, L., Wang, J., Liu, J., & Zhang, J. (2008). Privacy preserving in social networks against sensitive edge disclosure.","DOI":"10.1137\/1.9781611972795.82"},{"key":"jaras.2013040101-17","doi-asserted-by":"crossref","unstructured":"Massa, P., & Avesani, P. (2009). Trust metrics in recommender systems. Computing with Social Trust, 1--27.","DOI":"10.1007\/978-1-84800-356-9_10"},{"key":"jaras.2013040101-18","doi-asserted-by":"crossref","unstructured":"Mislove, A., Koppula, H. S., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2008). Growth of the Flickr social network. In Proceedings of the 1st ACM SIGCOMM Workshop on Social Networks. Seattle, WA: ACM.","DOI":"10.1145\/1397735.1397742"},{"key":"jaras.2013040101-19","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K., Druschel, P., & Bhattacharjee, B. (2007). Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement (pp. 29-42). San Diego, CA: ACM.","DOI":"10.1145\/1298306.1298311"},{"key":"jaras.2013040101-20","doi-asserted-by":"crossref","unstructured":"Narayanan, A., & Shmatikov, V. (2009). De-anonymizing social networks. In Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (pp. 173--187). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/SP.2009.22"},{"key":"jaras.2013040101-21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"jaras.2013040101-22","doi-asserted-by":"crossref","unstructured":"Rubner, Y., Tomasi, C., & Guibas, L. (1998). A metric for distributions with applications to image databases. Computer Vision, 59-66.","DOI":"10.1109\/ICCV.1998.710701"},{"key":"jaras.2013040101-23","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009). On the evolution of user interaction in Facebook. Proceedings of the 2nd ACM Workshop on Online Social Networks (pp. 37--42). Barcelona, Spain: ACM.","DOI":"10.1145\/1592665.1592675"},{"key":"jaras.2013040101-24","doi-asserted-by":"crossref","unstructured":"Wu, W., Xiao, Y., Wang, W., He, Z., & Wang, Z. (2010). k-Symmetry model for identity anonymization in social networks. EDBT (pp. 111--122). Lausanne, Switzerland: ACM.","DOI":"10.1145\/1739041.1739058"},{"key":"jaras.2013040101-25","doi-asserted-by":"crossref","unstructured":"Ying, X., & Wu, X. (2008). Randomizing social networks: a spectrum perserving approach. In Proceedings of the SIAM International Conference on Data Mining (April 2008), pp. 739-750 Key: citeulike:3819049 (pp. 739--750). Atlanta, GA: SIAM.","DOI":"10.1137\/1.9781611972788.67"},{"key":"jaras.2013040101-26","doi-asserted-by":"crossref","unstructured":"Zhang, L., & Zhang, W. (2009). Edge anonymity in social network graphs. In Proceedings of the 2009 International Conference on Computational Science and Engineering (pp. 1--8). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/CSE.2009.310"},{"key":"jaras.2013040101-27","doi-asserted-by":"crossref","unstructured":"Zhou, B., & Jian, P. (2008). Preserving privacy in social networks against neighborhood attacks. In Proceedings of the 24th IEEE International Conference on Data Engineering (ICDE'08) (pp. 506-515). Cancun, Mexico: IEEE Computer Society.","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"jaras.2013040101-28","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., & Ozsu, M. (2009). k-Automorphism: A general framework for privacy preserving network publication. In Proceedings of the VLDB Endowment (pp. 946-957).","DOI":"10.14778\/1687627.1687734"}],"container-title":["International Journal of Adaptive, Resilient and Autonomic Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=77630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:31:18Z","timestamp":1654115478000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jaras.2013040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jaras.2013040101","relation":{},"ISSN":["1947-9220","1947-9239"],"issn-type":[{"value":"1947-9220","type":"print"},{"value":"1947-9239","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}