scholarly journals Privacy Preservation for Friend-Recommendation Applications

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Weicheng Wang ◽  
Shengling Wang ◽  
Jianhui Huang

Friend-recommendation applications as one kind of typical social applications can satisfy the social contact needs of different users and become tools for developing a social relationship. However, the privacy leakage has turned into an insurmountable obstacle to the market success of such applications. Existing privacy protection approaches for social applications either introduce untrusted third parties or sacrifice information accuracy. As for friend-recommendation applications particularly, the multihop trust chain and anonymous message methods still have a defect that the hacker can act as a user to acquire information. In this paper, we put forward the privacy protection mechanism based on zero knowledge without any privacy leakage to the application server. In detail, the server knows nothing about the user’s information, but can still provide users with accurate information on friend recommendation. We also analyze the potential attack methods and propose the corresponding solution. Our simulation results verify the effectivity and efficiency of our scheme.

Author(s):  
Zice Sun ◽  
Yingjie Wang ◽  
Zhipeng Cai ◽  
Tianen Liu ◽  
Xiangrong Tong ◽  
...  

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Wei Jiang ◽  
Ruijin Wang ◽  
Zhiyuan Xu ◽  
Yaodong Huang ◽  
Shuo Chang ◽  
...  

The fast developing social network is a double-edged sword. It remains a serious problem to provide users with excellent mobile social network services as well as protecting privacy data. Most popular social applications utilize behavior of users to build connection with people having similar behavior, thus improving user experience. However, many users do not want to share their certain behavioral information to the recommendation system. In this paper, we aim to design a secure friend recommendation system based on the user behavior, called PRUB. The system proposed aims at achieving fine-grained recommendation to friends who share some same characteristics without exposing the actual user behavior. We utilized the anonymous data from a Chinese ISP, which records the user browsing behavior, for 3 months to test our system. The experiment result shows that our system can achieve a remarkable recommendation goal and, at the same time, protect the privacy of the user behavior information.


2021 ◽  
Vol 13 (1) ◽  
pp. 20-39
Author(s):  
Ahmed Aloui ◽  
Okba Kazar

In mobile business (m-business), a client sends its exact locations to service providers. This data may involve sensitive and private personal information. As a result, misuse of location information by the third party location servers creating privacy issues for clients. This paper provides an overview of the privacy protection techniques currently applied by location-based mobile business. The authors first identify different system architectures and different protection goals. Second, this article provides an overview of the basic principles and mechanisms that exist to protect these privacy goals. In a third step, the authors provide existing privacy protection measures.


2021 ◽  
Vol 21 (S1) ◽  
Author(s):  
Jie Su ◽  
Yi Cao ◽  
Yuehui Chen ◽  
Yahui Liu ◽  
Jinming Song

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.


2021 ◽  
Vol 17 (12) ◽  
pp. 155014772110612
Author(s):  
Zhengqiang Ge ◽  
Xinyu Liu ◽  
Qiang Li ◽  
Yu Li ◽  
Dong Guo

To significantly protect the user’s privacy and prevent the user’s preference disclosure from leading to malicious entrapment, we present a combination of the recommendation algorithm and the privacy protection mechanism. In this article, we present a privacy recommendation algorithm, PrivItem2Vec, and the concept of the recommended-internet of things, which is a privacy recommendation algorithm, consisting of user’s information, devices, and items. Recommended-internet of things uses bidirectional long short-term memory, based on item2vec, which improves algorithm time series and the recommended accuracy. In addition, we reconstructed the data set in conjunction with the Paillier algorithm. The data on the server are encrypted and embedded, which reduces the readability of the data and ensures the data’s security to a certain extent. Experiments show that our algorithm is superior to other works in terms of recommended accuracy and efficiency.


Author(s):  
Ramanpreet Kaur ◽  
Tomaž Klobučar ◽  
Dušan Gabrijelčič

This chapter is concerned with the identification of the privacy threats to provide a feedback to the users so that they can make an informed decision based on their desired level of privacy. To achieve this goal, Solove's taxonomy of privacy violations is refined to incorporate the modern challenges to the privacy posed by the evolution of social networks. This work emphasizes on the fact that the privacy protection should be a joint effort of social network owners and users, and provides a classification of mitigation strategies according to the party responsible for taking these countermeasures. In addition, it highlights the key research issues to guide the research in the field of privacy preservation. This chapter can serve as a first step to comprehend the privacy requirements of online users and educate the users about their choices and actions in social media.


Author(s):  
Feng Xu ◽  
Mingming Su ◽  
Yating Hou

The Cloud computing paradigm can improve the efficiency of distributed computing by sharing resources and data over the Internet. However, the security levels of nodes (or severs) are not the same, thus, sensitive tasks and personal data may be scheduled (or shared) to some unsafe nodes, which can lead to privacy leakage. Traditional privacy preservation technologies focus on the protection of data release and process of communication, but lack protection against disposing sensitive tasks to untrusted computing nodes. Therefore, this article put forwards a protocol based on task-transformation, by which tasks will be transformed into another form in the task manager before they can be scheduled to other nodes. The article describes a privacy preservation algorithm based on separation sensitive attributes from values (SSAV) to realize the task-transformation function. This algorithm separates sensitive attributes in the tasks from their values, which make the malicious nodes cannot comprehend the real meaning of the values even they get the transformed tasks. Analysis and simulation results show that the authors' algorithm is more effective.


Sign in / Sign up

Export Citation Format

Share Document