Local Node Differential Privacy
This work develops a framework for answering graph queries privately using Local Node Differential Privacy (LNDP*). It introduces a 'blurry degree distribution' ($ ext{ddf}_s G$) to approximate true graph statistics while ensuring privacy. The method balances inherent approximation error from blurring with noise error, proving the framework is asymptotically tight for specific applications.