Order-Revealing Encryption and the Hardness of Private Learning

3 May 2015

Papers citing "Order-Revealing Encryption and the Hardness of Private Learning"

11 / 11 papers shown

Title
Data Reconstruction: When You See It and When You Don't Edith Cohen Haim Kaplan Yishay Mansour Shay Moran Kobbi Nissim Uri Stemmer Eliad Tsfadia AAML 42 2 0 24 May 2024
Private PAC Learning May be Harder than Online Learning Mark Bun Aloni Cohen Rathin Desai 22 2 0 16 Feb 2024
Private Truly-Everlasting Robust-Prediction Uri Stemmer 24 0 0 09 Jan 2024
Private Everlasting Prediction M. Naor Kobbi Nissim Uri Stemmer Chao Yan 30 3 0 16 May 2023
A Computational Separation between Private Learning and Online Learning Mark Bun FedML 6 9 0 11 Jul 2020
Quantum statistical query learning Srinivasan Arunachalam A. Grilo Henry Yuen 17 32 0 19 Feb 2020
How Hard Is Robust Mean Estimation? Samuel B. Hopkins Jerry Li 6 36 0 19 Mar 2019
Private Center Points and Learning of Halfspaces A. Beimel Shay Moran Kobbi Nissim Uri Stemmer 12 32 0 27 Feb 2019
Differentially Private Learning of Geometric Concepts Haim Kaplan Yishay Mansour Yossi Matias Uri Stemmer FedML 19 6 0 13 Feb 2019
Strong Hardness of Privacy from Weak Traitor Tracing Lucas Kowalczyk T. Malkin Jonathan R. Ullman Mark Zhandry 36 10 0 20 Jul 2016
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity Vitaly Feldman David Xiao 175 71 0 25 Feb 2014