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
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Information revelation and privacy in online social networks
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Personalized privacy preservation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the 16th international conference on World Wide Web
Scalable modeling of real graphs using Kronecker multiplication
Proceedings of the 24th international conference on Machine learning
Towards identity anonymization on graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Efficient sampling of information in social networks
Proceedings of the 2008 ACM workshop on Search in social media
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Private Relationships in Social Networks
ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
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
Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques
Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques
A New Approach to Manage Security against Neighborhood Attacks in Social Networks
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
Social networking federation: A position paper
Computers and Electrical Engineering
| Hi-index | 0.00 |
Social networks provide a mathematical picture of various relationships that exist in society. A social network can be represented by graph data structures. These graphs are rich sources of information that must be published to share with the world. As a result, however, the privacy of users is compromised. Conventional techniques such as anonymization, randomization and masking are used to protect privacy. The techniques proposed to date do not consider the utility of published data. Absolute privacy implies zero utility, and vice versa. This paper focuses on the importance of users and the protection of their privacy. The importance of a user is determined by centrality or prestige measures. Generalization of the user is performed based on their importance to ensure privacy and utility in social networks. The information lost due to generalization is also measured.