Introduction to algorithms
Generalizing data to provide anonymity when disclosing information (abstract)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data Privacy through Optimal k-Anonymization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On the complexity of optimal K-anonymity
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM SIGKDD Explorations Newsletter
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Private social network analysis: how to assemble pieces of a graph privately
Proceedings of the 5th ACM workshop on Privacy in electronic society
Proceedings of the 16th international conference on World Wide Web
Privacy-Preserving Data Mining: Models and Algorithms
Privacy-Preserving Data Mining: Models and Algorithms
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Preserving the privacy of sensitive relationships in graph data
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Proceedings of the 18th international conference on World wide web
The union-split algorithm and cluster-based anonymization of social networks
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
On Link Privacy in Randomizing Social Networks
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
A brief survey on anonymization techniques for privacy preserving publishing of social network data
ACM SIGKDD Explorations Newsletter
Relationship privacy: output perturbation for queries with joins
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Anonymized data: generation, models, usage
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Data and Structural k-Anonymity in Social Networks
Privacy, Security, and Trust in KDD
Social networks integration and privacy preservation using subgraph generalization
Proceedings of the ACM SIGKDD Workshop on CyberSecurity and Intelligence Informatics
Preserving Privacy in Social Networks: A Structure-Aware Approach
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Privacy-Preserving Data Publishing
Foundations and Trends in Databases
Privacy and anonymization for very large datasets
Proceedings of the 18th ACM conference on Information and knowledge management
StarClique: guaranteeing user privacy in social networks against intersection attacks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Privacy challenges and solutions in the social web
Crossroads - The Social Web
Class-based graph anonymization for social network data
Proceedings of the VLDB Endowment
k-automorphism: a general framework for privacy preserving network publication
Proceedings of the VLDB Endowment
Terrorist and criminal social network data sharing andintegration
ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
k-symmetry model for identity anonymization in social networks
Proceedings of the 13th International Conference on Extending Database Technology
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
Algorithm-safe privacy-preserving data publishing
Proceedings of the 13th International Conference on Extending Database Technology
Privacy Preserving Categorical Data Analysis with Unknown Distortion Parameters
Transactions on Data Privacy
K-isomorphism: privacy preserving network publication against structural attacks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
k-Support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Prediction promotes privacy in dynamic social networks
WOSN'10 Proceedings of the 3rd conference on Online social networks
A Framework for Computing the Privacy Scores of Users in Online Social Networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Relationships and data sanitization: a study in scarlet
Proceedings of the 2010 workshop on New security paradigms
Personalized privacy protection in social networks
Proceedings of the VLDB Endowment
Resisting structural re-identification in anonymized social networks
The VLDB Journal — The International Journal on Very Large Data Bases
Anonymizing Set-Valued Social Data
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Social Network Analysis and Mining for Business Applications
ACM Transactions on Intelligent Systems and Technology (TIST)
PCTA: privacy-constrained clustering-based transaction data anonymization
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Privacy-aware data management in information networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Anonymizing shortest paths on social network graphs
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Utility-oriented K-anonymization on social networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Node protection in weighted social networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Generating random graphic sequences
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Surrogate parenthood: protected and informative graphs
Proceedings of the VLDB Endowment
Privacy-preserving social network publication against friendship attacks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Online social honeynets: trapping web crawlers in OSN
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
A comparison of two different types of online social network from a data privacy perspective
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
A generalization based approach for anonymizing weighted social network graphs
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Publishing anonymous survey rating data
Data Mining and Knowledge Discovery
LORA: link obfuscation by randomization in graphs
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Sharing graphs using differentially private graph models
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Anonymizing geo-social network datasets
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
On the privacy and utility of anonymized social networks
Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
Stalking online: on user privacy in social networks
Proceedings of the second ACM conference on Data and Application Security and Privacy
Utility-preserving transaction data anonymization with low information loss
Expert Systems with Applications: An International Journal
Combining ranking concept and social network analysis to detect collusive groups in online auctions
Expert Systems with Applications: An International Journal
Answering vertex aggregate queries using anonymized social network data
Proceedings of the 1st Workshop on Privacy and Security in Online Social Media
Utility-guided Clustering-based Transaction Data Anonymization
Transactions on Data Privacy
Limiting link disclosure in social network analysis through subgraph-wise perturbation
Proceedings of the 15th International Conference on Extending Database Technology
Protecting sensitive relationships against inference attacks in social networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Semi-Edge anonymity: graph publication when the protection algorithm is available
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Fine-grained access control of personal data
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
Towards identity disclosure control in private hypergraph publishing
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
EWNI: efficient anonymization of vulnerable individuals in social networks
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Injecting uncertainty in graphs for identity obfuscation
Proceedings of the VLDB Endowment
Sensitive label privacy protection on social network data
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A clustering approach for structural k-anonymity in social networks using genetic algorithm
Proceedings of the CUBE International Information Technology Conference
Delineating social network data anonymization via random edge perturbation
Proceedings of the 21st ACM international conference on Information and knowledge management
Discretionary social network data revelation with a user-centric utility guarantee
Proceedings of the 21st ACM international conference on Information and knowledge management
Comparing random-based and k-anonymity-based algorithms for graph anonymization
MDAI'12 Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence
Privacy protection in social networks using l-diversity
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Transforming graph data for statistical relational learning
Journal of Artificial Intelligence Research
Privacy protection in personalized web search: a peer group-based approach
SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Classifying online social network users through the social graph
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
STK-anonymity: k-anonymity of social networks containing both structural and textual information
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Privacy preserving release of blogosphere data in the presence of search engines
Information Processing and Management: an International Journal
A first view of exedra: a domain-specific language for large graph analytics workflows
Proceedings of the 22nd international conference on World Wide Web companion
An algorithm for k-degree anonymity on large networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
GASNA: greedy algorithm for social network anonymization
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Outsourcing shortest distance computing with privacy protection
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently anonymizing social networks with reachability preservation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Sensitive edges protection in social networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
A refined complexity analysis of degree anonymization in graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Anonymizing social networks: A generalization approach
Computers and Electrical Engineering
Sensitive and Neighborhood Privacy on Shortest Paths in the Cloud
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Relationship-based information sharing in cloud-based decentralized social networks
Proceedings of the 4th ACM conference on Data and application security and privacy
Graph publication when the protection algorithm is available
Data & Knowledge Engineering
Structure-aware graph anonymization
Web Intelligence and Agent Systems
Journal of Information Science
K-anonymous path privacy on social graphs
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
| Hi-index | 0.00 |
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in its basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, we study a specific graph-anonymization problem. We call a graph k-degree anonymous if for every node v, there exist at least k-1 other nodes in the graph with the same degree as v. This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. We formally define the graph-anonymization problem that, given a graph G, asks for the k-degree anonymous graph that stems from G with the minimum number of graph-modification operations. We devise simple and efficient algorithms for solving this problem. Our algorithms are based on principles related to the realizability of degree sequences. We apply our methods to a large spectrum of synthetic and real datasets and demonstrate their efficiency and practical utility.