Data sanitization for privacy preservation on Social Network

2016 ◽  
Author(s):  
Prajakta Tambe ◽  
Deepali Vora
Keyword(s):  
Social Network ◽  
Privacy Preservation ◽  
Data Sanitization

scholarly journals Privacy protection of medical data in social network

2021 ◽  
Vol 21 (S1) ◽  
Author(s):  
Jie Su ◽  
Yi Cao ◽  
Yuehui Chen ◽  
Yahui Liu ◽  
Jinming Song
Keyword(s):  
Social Network ◽  
Privacy Protection ◽  
Privacy Preservation ◽  
Medical Data ◽  
Research Field ◽  
Data Availability ◽  
Published Data ◽  
Institute Of Medicine ◽  
The Usa ◽  
Medical Dataset

Abstract Background Protection of privacy data published in the health care field is an important research field. The Health Insurance Portability and Accountability Act (HIPAA) in the USA is the current legislation for privacy protection. However, the Institute of Medicine Committee on Health Research and the Privacy of Health Information recently concluded that HIPAA cannot adequately safeguard the privacy, while at the same time researchers cannot use the medical data for effective researches. Therefore, more effective privacy protection methods are urgently needed to ensure the security of released medical data. Methods Privacy protection methods based on clustering are the methods and algorithms to ensure that the published data remains useful and protected. In this paper, we first analyzed the importance of the key attributes of medical data in the social network. According to the attribute function and the main objective of privacy protection, the attribute information was divided into three categories. We then proposed an algorithm based on greedy clustering to group the data points according to the attributes and the connective information of the nodes in the published social network. Finally, we analyzed the loss of information during the procedure of clustering, and evaluated the proposed approach with respect to classification accuracy and information loss rates on a medical dataset. Results The associated social network of a medical dataset was analyzed for privacy preservation. We evaluated the values of generalization loss and structure loss for different values of k and a, i.e. $$k$$ k  = {3, 6, 9, 12, 15, 18, 21, 24, 27, 30}, a = {0, 0.2, 0.4, 0.6, 0.8, 1}. The experimental results in our proposed approach showed that the generalization loss approached optimal when a = 1 and k = 21, and structure loss approached optimal when a = 0.4 and k = 3. Conclusion We showed the importance of the attributes and the structure of the released health data in privacy preservation. Our method achieved better results of privacy preservation in social network by optimizing generalization loss and structure loss. The proposed method to evaluate loss obtained a balance between the data availability and the risk of privacy leakage.

Privacy Preserving Approaches for Online Social Network Data Publishing

2021 ◽  
pp. 119-132
Author(s):  
Kamalkumar Macwan ◽  
Sankita Patel
Keyword(s):  
Social Network ◽  
Privacy Preservation ◽  
Differential Privacy ◽  
Online Social Network ◽  
Data Publishing ◽  
Network Data ◽  
User Privacy ◽  
Social Network Data ◽  
Huge Data ◽  
Popularity Prediction

Recently, the social network platforms have gained the attention of people worldwide. People post, share, and update their views freely on such platforms. The huge data contained on social networks are utilized for various purposes like research, market analysis, product popularity, prediction, etc. Although it provides so much useful information, it raises the issue regarding user privacy. This chapter discusses the various privacy preservation methods applied to the original social network dataset to preserve privacy against attacks. The two areas for privacy preservation approaches addressed in this chapter are anonymization in social network data publication and differential privacy in node degree publishing.

scholarly journals A Differentiated Anonymity Algorithm for Social Network Privacy Preservation

Algorithms ◽  
2016 ◽  
Vol 9 (4) ◽  
pp. 85 ◽  
Author(s):  
Yuqin Xie ◽  
Mingchun Zheng
Keyword(s):  
Social Network ◽  
Privacy Preservation

Self-Adaptive Optimization for Improved Data Sanitization and Restoration

2020 ◽  
Vol 28 (03) ◽  
pp. 391-420
Author(s):  
Geeta S. Navale ◽  
Suresh N. Mali
Keyword(s):  
Data Mining ◽  
Privacy Preservation ◽  
Loss Rate ◽  
Differential Evolution Algorithm ◽  
Adaptive Optimization ◽  
Data Set ◽  
Data Sanitization ◽  
Data Restoration ◽  
Evolution Algorithm ◽  
Self Adaptive

Nowadays, Data Sanitization is considered as a highly demanded area for solving the issue of privacy preservation in Data mining. Data Sanitization, means that the sensitive rules given by the users with the specific modifications and then releases the modified database so that, the unauthorized users cannot access the sensitive rules. Promisingly, the confidentiality of data is ensured against the data mining methods. The ultimate goal of this paper is to build an effective sanitization algorithm for hiding the sensitive rules given by users/experts. Meanwhile, this paper concentrates on minimizing the four sanitization research challenges namely, rate of hiding failure, rate of Information loss, rate of false rule generation and degree of modification. Moreover, this paper proposes a heuristic optimization algorithm named Self-Adaptive Firefly (SAFF) algorithm to generate the small length key for data sanitization and also to adopt lossless data sanitization and restoration. The generated optimized key is used for both data sanitation as well as the data restoration process. The proposed SAFF-based algorithm is compared and examined against the other existing sanitizing algorithms like Fire Fly (FF), Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Differential Evolution algorithm (DE) algorithms and the results have shown the excellent performance of proposed algorithm. The proposed algorithm is implemented in JAVA. The data set used are Chess, Retail, T10, and T40.

scholarly journals Privacy preservation in mobile social networks

2019 ◽  
Author(s):  
◽  
Douglas Steiert
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Networking ◽  
Privacy Preservation ◽  
Location Based Services ◽  
Mobile Social Networks ◽  
Privacy Concerns ◽  
Average Person ◽  
Effectiveness And Efficiency ◽  
Privacy Breaches

In this day and age with the prevalence of smartphones, networking has evolved in an intricate and complex way. With the help of a technology-driven society, the term "social networking" was created and came to mean using media platforms such as Myspace, Facebook, and Twitter to connect and interact with friends, family, or even complete strangers. Websites are created and put online each day, with many of them possessing hidden threats that the average person does not think about. A key feature that was created for vast amount of utility was the use of location-based services, where many websites inform their users that the website will be using the users' locations to enhance the functionality. However, still far too many websites do not inform their users that they may be tracked, or to what degree. In a similar juxtaposed scenario, the evolution of these social networks has allowed countless people to share photos with others online. While this seems harmless at face-value, there may be times in which people share photos of friends or other non-consenting individuals who do not want that picture viewable to anyone at the photo owner's control. There exists a lack of privacy controls for users to precisely de fine how they wish websites to use their location information, and for how others may share images of them online. This dissertation introduces two models that help mitigate these privacy concerns for social network users. MoveWithMe is an Android and iOS application which creates decoys that move locations along with the user in a consistent and semantically secure way. REMIND is the second model that performs rich probability calculations to determine which friends in a social network may pose a risk for privacy breaches when sharing images. Both models have undergone extensive testing to demonstrate their effectiveness and efficiency.

Sign in / Sign up

Export Citation Format

Share Document