The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Resisting structural re-identification in anonymized social networks
Open accessAbstract
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links representing relations such as friendship, communication, or shared activity. Maintaining privacy when publishing networked data is uniquely challenging because an individual's network context can be used to identify them even if other identifying information is removed. In this paper, we quantify the privacy risks associated with three classes of attacks on the privacy of individuals in networks, based on the knowledge used by the adversary. We show that the risks of these attacks vary greatly based on network structure and size. We propose a novel approach to anonymizing network data that models aggregate network structure and then allows samples to be drawn from that model. The approach guarantees anonymity for network entities while preserving the ability to estimate a wide variety of network measures with relatively little bias.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Fields, J. (2001) · Cited by 4,160
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
Probability and computing: randomized algorithms and probabilistic analysis
Mitzenmacher, M., & Upfal, E. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,824
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Mitzenmacher, M., & Upfal, E. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813603 · Cited by 1,733
Samarati, P., & Sweeney, L. (2018) · doi:10.1184/r1/6625469 · Cited by 1,326
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
Growing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
Smooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
A random graph model for massive graphs
Aiello, W., Chung, F., & Lu, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335326 · Cited by 917
Backstrom, L., Dwork, C., & Kleinberg, J. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242598 · Cited by 850
Towards identity anonymization on graphs
Liu, K., & Terzi, E. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376629 · Cited by 773
Preserving Privacy in Social Networks Against Neighborhood Attacks
Zhou, B., & Pei, J. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497459 · Cited by 719
The Earth Mover's distance is the Mallows distance: some insights from statistics
Levina, E., & Bickel, P. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937632 · Cited by 562
Boosting the accuracy of differentially private histograms through consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920970 · Cited by 528
Self-citationTowards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 519
M-invariance: towards privacy preserving re-publication of dynamic datasets
Xiao, X., & Tao, Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247556 · Cited by 466
k-automorphism: a general framework for privacy preserving network publication
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687734 · Cited by 409
Preserving the Privacy of Sensitive Relationships in Graph Data
Zheleva, E., & Getoor, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78478-4_9 · Cited by 403
Composition attacks and auxiliary information in data privacy
Ganta, S. R., Kasiviswanathan, S. P., & Smith, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401926 · Cited by 395
Accurate Estimation of the Degree Distribution of Private Networks
Hay, M., Li, C., Miklau, G., & Jensen, D. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.11 · Cited by 387
Self-citationNetwork topology generators: degree-based vs. structural
Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., & Willinger, W. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633040 · Cited by 375
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015470 · Cited by 354
An Efficient Algorithm for Graph Isomorphism
Corneil, D. G., & Gotlieb, C. C. (1970) · Journal of the ACM · doi:10.1145/321556.321562 · Cited by 334
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
Randomizing Social Networks: a Spectrum Preserving Approach
Ying, X., & Wu, X. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.67 · Cited by 311
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
Grochow, J. A., & Kellis, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71681-5_7 · Cited by 297
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J., & Diaconis, P. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 291
Minimality Attack in Privacy Preserving Data Publishing
Wong, R. C.-W., Fu, A. W.-C., Wang, K., & Pei, J. (2006) · Cited by 281
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Martin, D. J., Kifer, D., Machanavajjhala, A., Gehrke, J., & Halpern, J. Y. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367858 · Cited by 263
The boundary between privacy and utility in data publishing
Rastogi, V., Suciu, D. M., & Hong, S. (2007) · Very Large Data Bases · Cited by 228
Class-based graph anonymization for social network data
Bhagat, S., Cormode, G., Krishnamurthy, B., & Srivastava, D. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687714 · Cited by 225
Anonymizing bipartite graph data using safe groupings
Cormode, G., Srivastava, D., Yu, T., & Zhang, Q. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453947 · Cited by 222
Horizons of Observability and Limits of Informal Control in Organizations
Friedkin, N. E. (1983) · Social Forces · doi:10.1093/sf/62.1.54 · Cited by 198
Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs
Potterat, J. J., Phillips-Plummer, L., Muth, S. Q., Rothenberg, R. B., Woodhouse, D. E., Maldonado-Long, T. S., Zimmerman, H. P., & Muth, J. B. (2002) · Sexually Transmitted Infections · doi:10.1136/sti.78.suppl_1.i159 · Cited by 172
Attacks on privacy and deFinetti's theorem
Kifer, D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559861 · Cited by 162
Canonical labelling of graphs in linear average time
Babai, L., & Kucera, L. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.8 · Cited by 158
Rastogi, V., Hay, M., Miklau, G., & Suciu, D. M. (2009) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1559795.1559812 · Cited by 137
Self-citationEmergence of large cliques in random scale-free networks
Bianconi, G., & Matteo Marsili, A. (2006) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10574-3 · Cited by 95
Private social network analysis: how to assemble pieces of a graph privately
Frikken, K. B., & Golle, P. (2006) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1179601.1179619 · Cited by 55
Diversity of graphs with highly variable connectivity
Alderson, D., & Li, L. (2007) · Physical Review E · doi:10.1103/physreve.75.046102 · Cited by 50
Measuring Topological Anonymity in Social Networks
Singh, L., & Zhan, J. (2007) · IEEE International Conference on Granular Computing (GrC) · doi:10.1109/grc.2007.31 · Cited by 29
Cited by
The ethics of big data: current and foreseeable issues in biomedical contexts
Mittelstadt, B. D., & Floridi, L. (2016) · Science and Engineering Ethics · doi:10.1007/s11948-015-9652-2 · Cited by 714
Zheleva, E., & Getoor, L. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526781 · Cited by 534
Boosting the accuracy of differentially private histograms through consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920970 · Cited by 528
Self-citationA brief survey on anonymization techniques for privacy preserving publishing of social network data
Zhou, B., Pei, J., & Luk, W. (2008) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1540276.1540279 · Cited by 420
k-automorphism: a general framework for privacy preserving network publication
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687734 · Cited by 409
Metadata
- Authors
- Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2008-08
- Volume
- 1
- Issue
- 1
- Pages
- 102-114
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2124849257
- Cited by
- 549
- References
- 57
- FWCI
- 60.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.