Optimized Multi-Level Security for Content Contribution and Retrieval in Online Social Networks using a Content Visualization Mechanism
Received: 10 September 2024 | Revised: 9 October 2024 and 13 October 2024 | Accepted: 14 October 2024 | Online: 26 October 2024
Corresponding author: S. Nasira Tabassum
Abstract
Online social networks have become an integral part of modern communication, providing platforms for users to share personal information, media, and opinions. However, these platforms face significant challenges in preserving user privacy while ensuring efficient data retrieval and maintaining data integrity. Existing privacy preservation methods, such as PPK-MEANS, CFCAF, and CLDPP, are limited in their ability to handle the growing complexity and scale of user data, often leading to inefficiencies such as high Content Retrieval Time (CRT), increased Information Loss (IL), and compromised data accuracy. These inefficiencies are crucial to address, as they can degrade the user experience by causing delays, compromising data integrity, and limiting system scalability. High CRT frustrates users, while increased IL reduces data accuracy, undermining trust and system reliability. The primary issue addressed in this study is the need for an advanced privacy-preserving mechanism that can provide multilevel security while maintaining optimal system performance. To overcome these limitations, the Layered Secure Online Collaborative Verification (LSOCV) algorithm is proposed, designed to offer a scalable solution with tiered privacy controls based on user requirements. LSOCV enhances Privacy Retrieval Accuracy (PRA), significantly reduces CRT, and minimizes IL. The experimental results show that LSOCV achieved a PRA of 91.97%, reduced CRT to 7ms, and decreased IL by up to 8% for 500KB files, outperforming existing approaches. This method provides robust privacy protection and efficient data handling on social networks, with the potential for future application in big data environments, such as Hadoop, to ensure scalable, secure, and efficient privacy-preserving solutions.
Keywords:
social networks, complexity, information retrieval, privacyDownloads
References
H. K. Bhuyan and N. K. Kamila, "Privacy preserving sub-feature selection in distributed data mining," Applied Soft Computing, vol. 36, pp. 552–569, Nov. 2015.
A. F. Khalil and S. Rostam, "Machine Learning-based Predictive Maintenance for Fault Detection in Rotating Machinery: A Case Study," Engineering, Technology & Applied Science Research, vol. 14, no. 2, pp. 13181–13189, Apr. 2024.
A. S. Q. Syed, C. Atheeq, L. Ali, and M. T. Quasim, "Α Chaotic Map-based Approach to Reduce Black Hole Attacks and Authentication Computational Time in MANETs," Engineering, Technology & Applied Science Research, vol. 14, no. 3, pp. 13909–13915, Jun. 2024.
G. Alotibi, "A Cybersecurity Awareness Model for the Protection of Saudi Students from Social Media Attacks," Engineering, Technology & Applied Science Research, vol. 14, no. 2, pp. 13787–13795, Apr. 2024.
L. Bahri, B. Carminati, and E. Ferrari, "Decentralized privacy preserving services for Online Social Networks," Online Social Networks and Media, vol. 6, pp. 18–25, Jun. 2018.
K. Berlin, D. Slater, and J. Saxe, "Malicious Behavior Detection using Windows Audit Logs," in Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, Denver, CO, USA, Oct. 2015, pp. 35–44.
S. Khalid, S. Wu, A. Alam, and I. Ullah, "Real-time feedback query expansion technique for supporting scholarly search using citation network analysis," Journal of Information Science, vol. 47, no. 1, pp. 3–15, Feb. 2021.
S. Khalid, S. Khusro, I. Ullah, and G. Dawson-Amoah, "On The Current State of Scholarly Retrieval Systems," Engineering, Technology & Applied Science Research, vol. 9, no. 1, pp. 3863–3870, Feb. 2019.
J. H. Abawajy, M. I. H. Ninggal, and T. Herawan, “Privacy Preserving Social Network Data Publication,” IEEE Communications Surveys & Tutorials, vol. 18, no. 3, pp. 1974–1997, 2016.
A. Erola, J. Castellà-Roca, A. Viejo, and J. M. Mateo-Sanz, "Exploiting social networks to provide privacy in personalized web search," Journal of Systems and Software, vol. 84, no. 10, pp. 1734–1745, Oct. 2011.
T. Zhu, J. Li, X. Hu, P. Xiong, and W. Zhou, "The Dynamic Privacy-Preserving Mechanisms for Online Dynamic Social Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 6, pp. 2962–2974, Jun. 2022.
S. Weifeng, S. Mingyang, L. Xidong, and L. Mingchu, "An Improved Personalized Filtering Recommendation Algorithm," Applied Mathematics & Information Sciences, vol. 5, no. 5–2, pp. 69–78, 2011.
M. A. Ferrag, L. Maglaras, and A. Ahmim, "Privacy-Preserving Schemes for Ad Hoc Social Networks: A Survey," IEEE Communications Surveys & Tutorials, vol. 19, no. 4, pp. 3015–3045, 2017.
Z. Erkin, T. Veugen, T. Toft, and R. L. Lagendijk, "Privacy-preserving distributed clustering," EURASIP Journal on Information Security, vol. 2013, no. 1, Nov. 2013, Art. no. 4.
K. Honda, T. Oda, D. Tanaka, and A. Notsu, "A Collaborative Framework for Privacy Preserving Fuzzy Co-Clustering of Vertically Distributed Cooccurrence Matrices," Advances in Fuzzy Systems, vol. 2015, no. 1, 2015, Art. no. 729072.
Downloads
How to Cite
License
Copyright (c) 2024 Shaik Nasira Tabassum, Gangadhara Rao Kancherla
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
