Using Convex Relaxations for Efficiently and Privately Releasing Marginals

DOI10.1145/2582112.2582123zbMath1401.68059OpenAlexW2095030632MaRDI QIDQ4635550

Cynthia Dwork, Kunal Talwar, Aleksandar Nikolov

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582123

zbMATH Keywords

convex relaxationdifferential privacymarginals

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Database theory (68P15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

An Improved Private Mechanism for Small Databases ⋮ PCPs and the hardness of generating synthetic data ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Structure and Sensitivity in Differential Privacy: Comparing K-Norm Mechanisms

This page was built for publication: Using Convex Relaxations for Efficiently and Privately Releasing Marginals