2 papers
cs.CR2025
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions
Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya
We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing…
cs.CR2025
Communication-Efficient Publication of Sparse Vectors under Differential Privacy
Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya
In this work, we propose a differentially private algorithm for publishing matrices aggregated from sparse vectors. These matrices include social network adjacency matrices, user-i…