Local Node Differential Privacy
Hey there, little explorer! 🚀 Imagine you and your friends are playing a game. Each of you has a secret list of who you play with.
This grown-up news is about a super clever way to count how many friends everyone has, without telling anyone your secret list!
It's like this: When you tell the grown-up how many friends you have, you whisper a number that's almost right, but a tiny bit fuzzy. 🤫 This makes it super hard for anyone to guess your exact secret.
Then, the grown-up adds all the fuzzy numbers together. They can still learn cool things, like if most kids have lots of friends or just a few, but your secrets stay safe! It's like magic for keeping secrets! ✨
arXiv:2602.15802v2 Announce Type: replace Abstract: We initiate an investigation of node differential privacy for graphs in the local model of private data analysis. In our model, dubbed LNDP*, each node sees its own edge list and releases the output of a local randomizer on this input. These outputs are aggregated by an untrusted server to obtain a final output. We develop a novel algorithmic framework for this setting that allows us to accurately answer arbitrary linear queries about the input graph's degree distribution. Our framework is based on a new object, called the blurry degree distribution, which closely approximates the degree distribution and has lower sensitivity. Instead of answering queries about the degree distribution directly, our algorithms answer queries about the blur
View PDF
Abstract:We initiate an investigation of node differential privacy for graphs in the local model of private data analysis. In our model, dubbed LNDP*, each node sees its own edge list and releases the output of a local randomizer on this input. These outputs are aggregated by an untrusted server to obtain a final output. We develop a novel algorithmic framework for this setting that allows us to accurately answer arbitrary linear queries about the input graph's degree distribution. Our framework is based on a new object, called the blurry degree distribution, which closely approximates the degree distribution and has lower sensitivity. Instead of answering queries about the degree distribution directly, our algorithms answer queries about the blurry degree distribution. This framework yields accurate LNDP* algorithms for the edge count, PMF and CDF of the degree distribution, and other graph statistics. For some natural problems, our algorithms match the accuracy achievable with node privacy in the central model, where data are held and processed by a trusted server. We also prove lower bounds on the error required by LNDP* algorithms that imply the optimality of our framework for edge counting in sparse graphs and Erdos-Renyi parameter estimation. Our lower bounds apply even to interactive protocols with a constant number of rounds of interaction between the nodes and the server. Existing lower-bound techniques for related models either yield loose bounds or do not apply in our setting, as graph data results in inherently overlapping inputs to local randomizers. To prove our bounds, we develop a splicing argument that stitches together views from locally similar but globally different distributions on graphs to obtain hard instances. Finally, we prove structural results that reveal qualitative differences between local node privacy and the standard local model for tabular data.*
Subjects:
Data Structures and Algorithms (cs.DS); Cryptography and Security (cs.CR)
Cite as: arXiv:2602.15802 [cs.DS]
(or arXiv:2602.15802v2 [cs.DS] for this version)
https://doi.org/10.48550/arXiv.2602.15802
arXiv-issued DOI via DataCite
Submission history
From: Connor Wagaman [view email] [v1] Tue, 17 Feb 2026 18:41:48 UTC (93 KB) [v2] Wed, 1 Apr 2026 23:51:13 UTC (93 KB)
Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Releases
Probe launched after Hospital Authority data breach involving 56,000 patients
Hong Kong’s privacy watchdog and police are investigating a large-scale data leak involving over 56,000 patients served by the Hospital Authority, which reported the unauthorised retrieval of a variety of information. The Office of the Privacy Commissioner for Personal Data said on Saturday that it received a report from the authority on Friday, noting that patients’ names, identity card numbers, genders, dates of birth, dates of hospital visits and health information had been leaked. The health...
How 2 downed jets show a critical vulnerability for the US as Iran war rages on
One crew member from a US fighter jet shot down over Iran has been rescued by US forces, multiple news outlets reported on Friday, citing two US officials, while a second crew member remains missing. A separate US aircraft was also hit near the Strait of Hormuz, though its pilot was rescued safely, according to the reports. Iran on Friday claimed to have shot down an American fighter jet, releasing photos of apparent wreckage of an F-15E, while the United States reportedly launched a...
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!