arXiv Machine Learning

Differentially Private Range Subgraph Counting

arXiv:2606. 08179v1 Announce Type: cross Abstract: Subgraph counting is a fundamental problem in graph analysis.

arXiv Machine Learning
Jul 10

EdgeRefine: Privacy-Utility Balance for Graphs via Jaccard Sampling under Edge Differential Privacy

arXiv:2607. 08659v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have shown considerable success in learning from graph-structured data, but their use in privacy-sensitive areas remains difficult because graph structure can leak sensitive link information.

By Wenxiu Ding, Muzhi Liu, Zheng Yan, Mingjun Wang, Yifan Zhao, Qiao Liu
arXiv Machine Learning
Jul 2

The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting

arXiv:2607. 00876v1 Announce Type: cross Abstract: Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each individual.

By Konstantina Bairaktari, Kasper Green Larsen