The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Involuntary Information Leakage in Social Network Services
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
A measurement-driven analysis of information propagation in the flickr social network
Proceedings of the 18th international conference on World wide web
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
New Approach to Quantification of Privacy on Social Network Sites
AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Walking in facebook: a case study of unbiased sampling of OSNs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
The walls have ears: optimize sharing for visibility and privacy in online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Personally identifiable information leakage through online social networks
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
| Hi-index | 0.00 |
As an imperative channel for fast information propagation, Online Social Networks(OSNs) also have their defects. One of them is the information leakage, i.e., information could be spread via OSNs to the users whom we are not willing to share with. Thus the problem of constructing a circle of trust to share information with as many friends as possible without further spreading it to unwanted targets has become a challenging research topic but still remained open. Our work is the first attempt to study the Maximum Circle of Trust problem seeking to share the information with the maximum expected number of poster's friends such that the information spread to the unwanted targets is brought to its knees. First, we consider a special and more practical case with the two-hop information propagation and a single unwanted target. In this case, we show that this problem is NP-hard, which denies the existence of an exact polynomial-time algorithm. We thus propose a Fully Polynomial-Time Approximation Scheme (FPTAS), which can not only adjust any allowable performance error bound but also run in polynomial time with both the input size and allowed error. FPTAS is the best approximation solution one can ever wish for an NP-hard problem. We next consider the number of unwanted targets is bounded and prove that there does not exist an FPTAS in this case. Instead, we design a Polynomial-Time Approximation Scheme (PTAS) in which the allowable error can also be controlled. Finally, we consider a general case with many hops information propagation and further show its #P-hardness and propose an effective Iterative Circle of Trust Detection (ICTD) algorithm based on a novel greedy function. An extensive experiment on various real-word OSNs has validated the effectiveness of our proposed approximation and ICTD algorithms.