The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices
Journal of Combinatorial Theory Series A
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Proceedings of the 16th international conference on World Wide Web
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Anonymizing bipartite graph data using safe groupings
Proceedings of the VLDB Endowment
Persona: an online social network with user-defined privacy
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Social Network Privacy via Evolving Access Control
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Discovery and Protection of Sensitive Linkage Information for Online Social Networks Services
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Privacy-enhanced public view for social graphs
Proceedings of the 2nd ACM workshop on Social web search and mining
Privacy challenges and solutions in the social web
Crossroads - The Social Web
Personality traits, usage patterns and information disclosure in online communities
Proceedings of the 23rd British HCI Group Annual Conference on People and Computers: Celebrating People and Technology
Class-based graph anonymization for social network data
Proceedings of the VLDB Endowment
A measure of online social networks
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Anonymizing bipartite graph data using safe groupings
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy issues in scientific workflow provenance
Proceedings of the 1st International Workshop on Workflow Approaches to New Data-centric Science
Resisting structural re-identification in anonymized social networks
The VLDB Journal — The International Journal on Very Large Data Bases
Virtual private social networks
Proceedings of the first ACM conference on Data and application security and privacy
All liaisons are dangerous when all your friends are known to us
Proceedings of the 22nd ACM conference on Hypertext and hypermedia
On the privacy of anonymized networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Online social honeynets: trapping web crawlers in OSN
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
A secret sharing based privacy enforcement mechanism for untrusted social networking operators
MiFor '11 Proceedings of the 3rd international ACM workshop on Multimedia in forensics and intelligence
Revisiting link privacy in social networks
Proceedings of the second ACM conference on Data and Application Security and Privacy
Hiding data and structure in workflow provenance
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
A differentially private estimator for the stochastic Kronecker graph model
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Bridge analysis in a Social Internetworking Scenario
Information Sciences: an International Journal
FC'12 Proceedings of the 16th international conference on Financial Cryptography and Data Security
Privacy preserving release of blogosphere data in the presence of search engines
Information Processing and Management: an International Journal
Virtual private social networks and a facebook implementation
ACM Transactions on the Web (TWEB)
Hi-index | 0.00 |
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the typical social network interface and the information about links that it provides to its users in terms of lookahead. We consider a particular threat where an attacker subverts user accounts to get information about local neighborhoods in the network and pieces them together in order to get a global picture. We analyze, both experimentally and theoretically, the number of user accounts an attacker would need to subvert for a successful attack, as a function of his strategy for choosing users whose accounts to subvert and a function of lookahead provided by the network. We conclude that such an attack is feasible in practice, and thus any social network that wishes to protect the link privacy of its users should take great care in choosing the lookahead of its interface, limiting it to 1 or 2, whenever possible.