Analyzing Graphs with Node Differential Privacy
From MaRDI portal
Publication:4910293
DOI10.1007/978-3-642-36594-2_26zbMath1316.68050OpenAlexW2169861334MaRDI QIDQ4910293
No author found.
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_26
Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (10)
Some basics on privacy techniques, anonymization and their big data challenges ⋮ Affiliation weighted networks with a differentially private degree sequence ⋮ 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 ⋮ A lower bound on the release of differentially private integer partitions ⋮ Average Sensitivity of Graph Algorithms ⋮ Enhancing social network privacy with accumulated non-zero prior knowledge ⋮ Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs ⋮ The Complexity of Differential Privacy
This page was built for publication: Analyzing Graphs with Node Differential Privacy
