Private analysis of graph structure

DOI10.1145/2611523MaRDI QIDQ5012500zbMATH OpenOpenAlexFDO

Authors

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.8815

zbMATH Keywords

differential privacygraph algorithmssocial network analysisstatistical data privacy

Mathematics Subject Classification ID

Privacy of data (68P27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30)

Recommendations

• Analyzing graphs with node differential privacy
• Differentially private data analysis of social networks via restricted sensitivity
• Faster algorithms for privately releasing marginals
• The algorithmic foundations of differential privacy
• Private data release via learning thresholds

Cited in

(12)

• Analysis of centrality measures under differential privacy models
• 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
• Analyzing graphs with node differential privacy
• Privacy-preserving subgraph matching protocol for two parties
• Privacy-Preserving Graph Algorithms in the Semi-honest Model
• Inference using noisy degrees: differentially private -model and synthetic graphs
• Average Sensitivity of Graph Algorithms
• Differentially private graph publishing through noise-graph addition
• An efficient query recovery attack against a graph encryption scheme
• Privacy preserving link analysis on dynamic weighted graph

This page was built for publication: Private analysis of graph structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012500)