TY - GEN
T1 - On Differential Privacy and Adaptive Data Analysis with Bounded Space
AU - Dinur, Itai
AU - Stemmer, Uri
AU - Woodruff, David P.
AU - Zhou, Samson
N1 - Publisher Copyright:
© 2023, International Association for Cryptologic Research.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - We study the space complexity of the two related fields of differential privacy and adaptive data analysis. Specifically, 1.Under standard cryptographic assumptions, we show that there exists a problem P that requires exponentially more space to be solved efficiently with differential privacy, compared to the space needed without privacy. To the best of our knowledge, this is the first separation between the space complexity of private and non-private algorithms.2.The line of work on adaptive data analysis focuses on understanding the number of samples needed for answering a sequence of adaptive queries. We revisit previous lower bounds at a foundational level, and show that they are a consequence of a space bottleneck rather than a sampling bottleneck. To obtain our results, we define and construct an encryption scheme with multiple keys that is built to withstand a limited amount of key leakage in a very particular way.
AB - We study the space complexity of the two related fields of differential privacy and adaptive data analysis. Specifically, 1.Under standard cryptographic assumptions, we show that there exists a problem P that requires exponentially more space to be solved efficiently with differential privacy, compared to the space needed without privacy. To the best of our knowledge, this is the first separation between the space complexity of private and non-private algorithms.2.The line of work on adaptive data analysis focuses on understanding the number of samples needed for answering a sequence of adaptive queries. We revisit previous lower bounds at a foundational level, and show that they are a consequence of a space bottleneck rather than a sampling bottleneck. To obtain our results, we define and construct an encryption scheme with multiple keys that is built to withstand a limited amount of key leakage in a very particular way.
UR - http://www.scopus.com/inward/record.url?scp=85161635916&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-30620-4_2
DO - 10.1007/978-3-031-30620-4_2
M3 - Conference contribution
AN - SCOPUS:85161635916
SN - 9783031306198
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 35
EP - 65
BT - Advances in Cryptology – EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2023, Proceedings
A2 - Hazay, Carmit
A2 - Stam, Martijn
PB - Springer Science and Business Media Deutschland GmbH
T2 - 42nd Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT 2023
Y2 - 23 April 2023 through 27 April 2023
ER -