A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries
Not on the map. Why?
Abstract (arXiv)
Releasing the result size of conjunctive queries and graph pattern queries under differential privacy (DP) has received considerable attention in the literature, but existing solutions do not offer any optimality guarantees. We provide the first DP mechanism for this problem with a fairly strong notion of optimality, which can be considered as a natural relaxation of instance-optimality to a constant.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 12 May 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.