Using convex relaxations for efficiently and privately releasing marginals (extended abstract)

DOI10.1145/2582112.2582123MaRDI QIDQ4635550zbMATH OpenOpenAlexFDO

Authors Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar

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 relaxationmarginalsdifferential privacy

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithms for privately releasing marginals via convex relaxations
• Faster algorithms for privately releasing marginals
• Faster private release of marginals on small databases
• Unconditional differentially private mechanisms for linear queries
• Private data release via learning thresholds

Cited in

(7)

• PCPs and the hardness of generating synthetic data
• Efficient algorithms for privately releasing marginals via convex relaxations
• Structure and sensitivity in differential privacy: comparing \(K\)-norm mechanisms
• Order-revealing encryption and the hardness of private learning
• An improved private mechanism for small databases
• How to Find a Point in the Convex Hull Privately
• Faster algorithms for privately releasing marginals

This page was built for publication: Using convex relaxations for efficiently and privately releasing marginals (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635550)