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
Ranking Entities Using Comparative Relations
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Graphical Histories for Visualization: Supporting Analysis, Communication, and Evaluation
IEEE Transactions on Visualization and Computer Graphics
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Relationship privacy: output perturbation for queries with joins
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Link analysis for private weighted graphs
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Accurate Estimation of the Degree Distribution of Private Networks
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
k-automorphism: a general framework for privacy preserving network publication
Proceedings of the VLDB Endowment
Personalized privacy protection in social networks
Proceedings of the VLDB Endowment
Surrogate parenthood: protected and informative graphs
Proceedings of the VLDB Endowment
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Privacy preserving semi-supervised learning for labeled graphs
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
| Hi-index | 0.00 |
In this paper, we propose new ideas to protect user privacy while allowing the use of a user history graph. We define new privacy notions for user history graphs and consider algorithms to generate a privacy-preserving digraph from the original graph.