Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing
Authors:
Open Access
- 28 June 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Abstract
No abstract availableKeywords
Funding Information
- Division of Computer and Network Systems (IIS-0546027CNS-0831204)
- Division of Information and Intelligent Systems (IIS-0546027CNS-0831204)
This publication has 24 references indexed in Scilit:
- Graph Generation with Prescribed Feature Constraints2009
- Randomization Techniques for Graphs2009
- On Link Privacy in Randomizing Social Networks2009
- A brief survey on anonymization techniques for privacy preserving publishing of social network dataACM SIGKDD Explorations Newsletter, 2008
- Resisting structural re-identification in anonymized social networksProceedings of the VLDB Endowment, 2008
- Randomizing Social Networks: a Spectrum Preserving Approach2008
- Challenges in mining social network data2007
- Characterization of complex networks: A survey of measurementsAdvances in Physics, 2007
- Discovering Hidden Groups in Communication Networks2004
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002