Jonathan Ullman
Answering n{2+o(1)} counting queries with differential privacy is hard
STOC, 2013.
@inproceedings{STOC-2013-Ullman,
author = "Jonathan Ullman",
booktitle = "{Proceedings of the 45th Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/2488608.2488653",
isbn = "978-1-4503-2029-0",
pages = "361--370",
publisher = "{ACM}",
title = "{Answering n{2+o(1)} counting queries with differential privacy is hard}",
year = 2013,
}











