May 26, 2023, 1:18 a.m. | Kobbi Nissim, Uri Stemmer, Eliad Tsfadia

cs.CR updates on

In adaptive data analysis, a mechanism gets $n$ i.i.d. samples from an
unknown distribution $D$, and is required to provide accurate estimations to a
sequence of adaptively chosen statistical queries with respect to $D$. Hardt
and Ullman (FOCS 2014) and Steinke and Ullman (COLT 2015) showed that in
general, it is computationally hard to answer more than $\Theta(n^2)$ adaptive
queries, assuming the existence of one-way functions.

However, these negative results strongly rely on an adversarial model that
significantly advantages the …

adversarial analysis data data analysis distribution general respect

More from / cs.CR updates on

Toronto Transit Commission (TTC) - Chief Information Security Officer (CISO)

@ BIPOC Executive Search Inc. | Toronto, Ontario, Canada

Security Analyst, AWS Security Messaging

@ | Seattle, Washington, USA

Mid-Level DevSecOps Engineer

@ Sigma Defense | United States - Remote

Senior Consultant, Cyber - Threat Security Operations (SOC, M365 Defender)

@ NielsenIQ | Chennai, India

Senior Email Security Researcher (Cortex XDR)

@ Palo Alto Networks | Tel Aviv-Yafo, Israel

Application Security Engineer

@ 10x Banking | India - Remote