An investigation of a dynamic model of privacy trade-off in use of mobile social network applications: A longitudinal perspective

2019 ◽  
Vol 119 ◽  
pp. 46-59 ◽  
Author(s):  
Mehrdad Koohikamali ◽  
Aaron M. French ◽  
Dan J. Kim
2018 ◽  
Vol 11 (2) ◽  
pp. 1-14 ◽  
Author(s):  
Ahmed Yousif Abdelraheem ◽  
◽  
Abdelrahman Mohammed Ahmed ◽  

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 24 (3) ◽  
pp. 1-23
Author(s):  
Louma Chaddad ◽  
Ali Chehab ◽  
Imad H. Elhajj ◽  
Ayman Kayssi

Research has proved that supposedly secure encrypted network traffic is actually threatened by privacy and security violations from many aspects. This is mainly due to flow features leaking evidence about user activity and data content. Currently, adversaries can use statistical traffic analysis to create classifiers for network applications and infer users’ sensitive data. In this article, we propose a system that optimally prevents traffic feature leaks. In our first algorithm, we model the packet length probability distribution of the source app to be protected and that of the target app that the source app will resemble. We define a model that mutates the packet lengths of a source app to those lengths from the target app having similar bin probability. This would confuse a classifier by identifying a mutated source app as the target app. In our second obfuscation algorithm, we present an optimized scheme resulting in a trade-off between privacy and complexity overhead. For this reason, we propose a mathematical model for network obfuscation. We formulate analytically the problem of selecting the target app and the length from the target app to mutate to. Then, we propose an algorithm to solve it dynamically. Extensive evaluation of the proposed models, on real app traffic traces, shows significant obfuscation efficiency with relatively acceptable overhead. We were able to reduce a classification accuracy from 91.1% to 0.22% using the first algorithm, with 11.86% padding overhead. The same classification accuracy was reduced to 1.76% with only 0.73% overhead using the second algorithm.


Sign in / Sign up

Export Citation Format

Share Document