Anonymizing bipartite graph data using safe groupings
- 1 August 2008
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 1 (1), 833-844
- https://doi.org/10.14778/1453856.1453947
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Link privacy in social networksPublished by Association for Computing Machinery (ACM) ,2008
- Preserving Privacy in Social Networks Against Neighborhood AttacksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- On the Anonymization of Sparse High-Dimensional DataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Wherefore art thou r3579x?Published by Association for Computing Machinery (ACM) ,2007
- Aggregate Query Answering on Anonymized TablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- MultiRelational k-AnonymityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- (α, k)-anonymityPublished by Association for Computing Machinery (ACM) ,2006
- L-diversity: privacy beyond k-anonymityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Protecting respondents identities in microdata releaseIEEE Transactions on Knowledge and Data Engineering, 2001