Peter, Naty, Tsfadia, Eliad, and Ullman, Jonathan.
"Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes". Country unknown/Code not available: Proceedings of Machine Learning Research. https://par.nsf.gov/biblio/10540029.
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.