{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:44:09Z","timestamp":1765039449497,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Online social network users share their information in different social sites to establish connections with individuals with whom they want to be a friend. While users share all their information to connect to other individuals, they need to hide the information that can bring about privacy risks for them. As user participation in social networking sites rises, the possibility of sharing information with unknown users increases, and the probability of privacy breaches for the user mounts. This work addresses the challenges of sharing information in a safe manner with unknown individuals. Currently, there are a number of available methods for preserving privacy in order to friending (the act of adding someone as a friend), but they only consider a single source of data and are more focused on users\u2019 security rather than privacy. Consequently, a privacy-preserving friending mechanism should be considered for information shared in multiple online social network sites. In this paper, we propose a new privacy-preserving friending method that helps users decide what to share with other individuals with the reduced risk of being exploited or re-identified. In this regard, the first step is to calculate the sensitivity score for individuals using Bernstein\u2019s polynomial theorem to understand what sort of information can influence a user\u2019s privacy. Next, a new model is applied to anonymise the data of users who participate in multiple social networks. Anonymisation helps to understand to what extent a piece of information can be shared, which allows information sharing with reduced risks in privacy. Evaluation indicates that measuring the sensitivity of information besides anonymisation provides a more accurate outcome for the purpose of friending, in a computationally efficient manner.<\/jats:p>","DOI":"10.3390\/computers7030042","type":"journal-article","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T03:44:18Z","timestamp":1533613458000},"page":"42","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Privacy-Enhanced Friending Approach for Users on Multiple Online Social Networks"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5232-4934","authenticated-orcid":false,"given":"Erfan","family":"Aghasian","sequence":"first","affiliation":[{"name":"School of Technology, Environments and Design, University of Tasmania, Hobart TAS 7001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8719-284X","authenticated-orcid":false,"given":"Saurabh","family":"Garg","sequence":"additional","affiliation":[{"name":"School of Technology, Environments and Design, University of Tasmania, Hobart TAS 7001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5360-7514","authenticated-orcid":false,"given":"James","family":"Montgomery","sequence":"additional","affiliation":[{"name":"School of Technology, Environments and Design, University of Tasmania, Hobart TAS 7001, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1111\/j.1083-6101.2007.00393.x","article-title":"Social network sites: Definition, history, and scholarship","volume":"13","author":"Boyd","year":"2007","journal-title":"J. Comput. Med. Commun."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Aghasian, E., Garg, S., and Montgomery, J. (arXiv, 2018). User\u2019s Privacy in Recommendation Systems Applying Online Social Network Data, A Survey and Taxonomy, arXiv.","DOI":"10.1049\/PBPC035F_ch12"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.chb.2014.12.012","article-title":"Privacy antecedents for SNS self-disclosure: The case of Facebook","volume":"45","author":"Zlatolas","year":"2015","journal-title":"Comput. Hum. Behav."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gross, R., and Acquisti, A. (2005, January 7). Information revelation and privacy in online social networks. Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, Alexandria, VA, USA.","DOI":"10.1145\/1102199.1102214"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.cose.2015.07.002","article-title":"Privacy attitudes and privacy behaviour: A review of current research on the privacy paradox phenomenon","volume":"64","author":"Kokolakis","year":"2017","journal-title":"Comput. Secur."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Sharma, S., and Gupta, B. (2018). Information Privacy on Online Social Networks: Illusion-in-Progress in the Age of Big Data. Analytics and Data Science, Springer.","DOI":"10.1007\/978-3-319-58097-5_13"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.sbspro.2012.09.1170","article-title":"Can We Assess and Monitor Privacy and Security Risk for Social Networks?","volume":"57","author":"Sahinoglu","year":"2012","journal-title":"Procedia Soc. Behav. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1177\/1461444809342058","article-title":"\u2018Friending\u2019: London-based undergraduates\u2019 experience of Facebook","volume":"11","author":"Lewis","year":"2009","journal-title":"New Med. Soc."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1002\/asi.20835","article-title":"Social networks, gender, and friending: An analysis of MySpace member profiles","volume":"59","author":"Thelwall","year":"2008","journal-title":"J. Assoc. Inform. Sci. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1080\/15228831003770775","article-title":"Privacy, social network sites, and social relations","volume":"28","author":"Houghton","year":"2010","journal-title":"J. Technol. Hum. Serv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"13118","DOI":"10.1109\/ACCESS.2017.2720187","article-title":"Scoring Users\u2019 Privacy Disclosure Across Multiple Online Social Networks","volume":"5","author":"Aghasian","year":"2017","journal-title":"IEEE Access"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Zhang, L., Li, X.Y., and Liu, Y. (2013, January 8\u201311). Message in a sealed bottle: Privacy preserving friending in social networks. Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), Philadelphia, PA, USA.","DOI":"10.1109\/ICDCS.2013.38"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/TMC.2014.2366773","article-title":"Message in a sealed bottle: Privacy preserving friending in mobile social networks","volume":"14","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_14","unstructured":"Preibusch, S., and Beresford, A.R. (2018, August 05). Privacy-Preserving Friendship Relations for Mobile Social Networking. Available online: https:\/\/www.w3.org\/2008\/09\/msnws\/papers\/Preibusch-BeresfordPrivacy-Preserving-Friendship-Relations.pdf."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.eswa.2017.05.054","article-title":"A privacy self-assessment framework for online social networks","volume":"86","author":"Pensa","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TDSC.2015.2443795","article-title":"My privacy my decision: Control of photo sharing on online social networks","volume":"14","author":"Xu","year":"2017","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"ref_17","unstructured":"Veiga, M.H., and Eickhoff, C. (arXiv, 2016). Privacy leakage through innocent content sharing in online social networks, arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Alsarkal, Y., Zhang, N., and Xu, H. (2018, January 3\u20136). Your Privacy Is Your Friend\u2019s Privacy: Examining Interdependent Information Disclosure on Online Social Networks. Proceedings of the 51st Hawaii International Conference on System Sciences, Waikoloa, HI, USA.","DOI":"10.24251\/HICSS.2018.111"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Srivastava, A., and Geethakumari, G. (2013, January 22\u201325). Measuring privacy leaks in online social networks. Proceedings of the International Conference on Advances in Computing, Communications and Informatics (ICACCI), Mysore, India.","DOI":"10.1109\/ICACCI.2013.6637504"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/1870096.1870102","article-title":"A framework for computing the privacy scores of users in online social networks","volume":"5","author":"Liu","year":"2010","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Nava, J., Kosheleva, O., and Kreinovich, V. (2012, January 10\u201315). Why Bernstein polynomials are better: fuzzy-inspired justification. Proceedings of the 2012 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Brisbane, Australia.","DOI":"10.1109\/FUZZ-IEEE.2012.6251341"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Baden, R., Bender, A., Spring, N., Bhattacharjee, B., and Starin, D. (2009, January 17\u201321). Persona: an online social network with user-defined privacy. Proceedings of the ACM SIGCOMM Computer Communication Review, Barcelona, Spain.","DOI":"10.1145\/1592568.1592585"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Guha, S., Tang, K., and Francis, P. (2008, January 17\u201322). NOYB: Privacy in online social networks. Proceedings of the First Workshop on Online Social Networks, Seattle, WA, USA.","DOI":"10.1145\/1397735.1397747"},{"key":"ref_24","unstructured":"\u00c5rnes, A., Skorstad, J., and Michelsen, L. (2018, August 05). Social network services and privacy. Available online: http:\/\/www.jukkarannila.fi\/docs\/11-00643-5-Part-I-RapportFacebook2011april2011.pdf."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ho, A., Maiga, A., and A\u00efmeur, E. (2009, January 10\u201313). Privacy protection issues in social networking sites. Proceedings of the International Conference on Computer Systems and Applications, Rabat, Morocco.","DOI":"10.1109\/AICCSA.2009.5069336"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1186\/s13635-014-0011-7","article-title":"Taxonomy of social network data types","volume":"1","author":"Richthammer","year":"2014","journal-title":"EURASIP J. Inf. Secur."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Schilling, R.L., Song, R., and Vondracek, Z. (2012). Bernstein Functions: Theory and Applications, Walter de Gruyter.","DOI":"10.1515\/9783110269338"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02296272","article-title":"A Rasch model for partial credit scoring","volume":"47","author":"Masters","year":"1982","journal-title":"Psychometrika"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., and Ramakrishnan, R. (2006, January 3\u20137). Mondrian multidimensional k-anonymity. Proceedings of the 22nd International Conference on Data Engineering (ICDE\u201906), Atlanta, GA, USA.","DOI":"10.1109\/ICDE.2006.101"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., and Fu, A.W.C. (2006, January 20\u201323). Utility-based anonymization using local recoding. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA.","DOI":"10.1145\/1150402.1150504"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Lin, J.L., and Wei, M.C. (2008, January 29). An efficient clustering method for k-anonymization. Proceedings of the 2008 International Workshop on Privacy and Anonymity in Information Society, Nantes, France.","DOI":"10.1145\/1379287.1379297"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/3\/42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:16:53Z","timestamp":1760195813000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/7\/3\/42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":31,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["computers7030042"],"URL":"https:\/\/doi.org\/10.3390\/computers7030042","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2018,8,6]]}}}