In this paper, we propose a protocol for privacy-preserving triangle counting when the overall graph is distributed to different parties. We firstly present the ...

Oct 17, 2018 · In this paper, we choose to use differential privacy to protect triangle counting for large scale graphs. To reduce the large sensitivity caused ...

In this paper, we propose a protocol for privacy-preserving triangle counting when the overall graph is distributed to different parties. We firstly present the ...

ey show how to estimate the number of triangles satisfying edge differential privacy in social networks and how to calibrate the noise of subgraph counting.

Abstract—Together with the popularity of graph structure in real world data, graph analysis has become an attractive research topic. Triangle counting is ...

This paper publishes the triangle counts satisfying the node-differential privacy with two kinds of histograms: the triangle count distribution and the ...

Nov 2, 2024 · In this paper, we choose to use differential privacy to protect triangle counting for large scale graphs. To reduce the large sensitivity caused ...

Triangle Counting with Local Edge Differential Privacy. Given ε ≥ 0 and δ ∈ [0, 1), a randomized algorithm A on a (distributed) graph G is. (ε, δ)-locally ...

Bibliographic details on Privacy-Preserving Triangle Counting in Distributed Graphs.

In this paper, we choose to use differential privacy to protect triangle counting for large scale graphs. To reduce the large sensitivity caused in large graphs ...