Surendra Ghentiyala

Overcoming the Randomness-Utility Trade-off in Answering Differentially Private Linear Queries

The algorithm can answer linear queries with differential privacy using few (expected) random bits using $O(d / \varepsilon)$ error using $O(\log d)$ random bits, improving upon algorithms of Canonne et al. and Ghentiyala.