A lower bound on the release of differentially private integer partitions

DOI10.1016/J.IPL.2017.09.001MaRDI QIDQ2410571zbMATH OpenOpenAlexFDO

Authors Francesco Aldà, Hans Ulrich Simon

Publication date 18 October 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2017.09.001

zbMATH Keywords

differential privacyinteger partitionsrandomized algorithms

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• On the complexity of differentially private data release, efficient algorithms and hardness results
• Lower bounds in differential privacy
• Optimal lower bound for differentially private multi-party aggregation
• Distributed Private Data Analysis
• Pure differential privacy for rectangle queries via private partitions
• Differentially private data release via statistical election to partition sequentially
• Lower bounds for differentially private RAMs
• Concentrated differential privacy: simplifications, extensions, and lower bounds
• Bounds on the sample complexity for private learning and private data release

Cites work

• Analyzing graphs with node differential privacy
• scientific article; zbMATH DE number 3907540 (Why is no real title available?)
• scientific article; zbMATH DE number 1064667 (Why is no real title available?)
• scientific article; zbMATH DE number 4001210 (Why is no real title available?)
• On the geometry of differential privacy
• Theory of Cryptography

This page was built for publication: A lower bound on the release of differentially private integer partitions

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