Subgraph Counting with Local Node Differential Privacy

arXiv:2610.22278 · cs.DS, cs.CR · Submitted 2026-10-15 · Read on arXiv

cs.DS, cs.CR

Submitted: 2026-10-15

Updated: 2026-10-15

Comments: To appear at the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2027

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Differential Privacy — 1× in this paper · explained in 4 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing