Analyzing graphs with node differential privacy
From MaRDI portal
Recommendations
- Private analysis of graph structure
- Differentially private data analysis of social networks via restricted sensitivity
- Analysis of centrality measures under differential privacy models
- Random projections, graph sparsification, and differential privacy
- The algorithmic foundations of differential privacy
Cited in
(20)- Some basics on privacy techniques, anonymization and their big data challenges
- Affiliation weighted networks with a differentially private degree sequence
- Enhancing social network privacy with accumulated non-zero prior knowledge
- Analysis of centrality measures under differential privacy models
- A lower bound on the release of differentially private integer partitions
- Random projections, graph sparsification, and differential privacy
- Differentially private data analysis of social networks via restricted sensitivity
- Towards privacy for social networks: a zero-knowledge based definition of privacy
- Private analysis of graph structure
- The complexity of differential privacy
- Directed Networks with a Differentially Private Bi-degree Sequence
- Asymptotics in theβ-model for networks with a differentially private degree sequence
- Weighted directed networks with a differentially private bi-degree sequence
- Inference using noisy degrees: differentially private -model and synthetic graphs
- Average Sensitivity of Graph Algorithms
- Differentially private graph publishing through noise-graph addition
- Differentially private estimation in a class of bipartite graph models
- Differentially private Kolmogorov-Smirnov-type tests
- Asymptotics in the Bradley-Terry model for networks with a differentially private degree sequence
- Sublinear space graph algorithms in the continual release model
This page was built for publication: Analyzing graphs with node differential privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910293)
