Table 4.4

Upper and lower bounds on the expected maximum error for frequency estimation on domains of size B and over n users in different models of DP. The bounds are stated for fixed, positive privacy parameters ε and δ, and Θ˜/O˜/Ω˜ asymptotic notation suppresses factors that are polylogarithmic in B and n. The communication per user is in terms of the total number of bits sent. In all upper bounds, the protocol is symmetric with respect to the users, and no public randomness is needed. References are to the first results we are aware of that imply the stated bounds

LocalLocal+ ShuffleShuffled, SingleMessageShuffled, MultiMessageCentral
Expected max. errorO˜(n)Ω˜(n)O˜(min(n4,B))Ω˜(min(n4,B))Θ˜(1)Θ˜(1)
Communication/ userϴ(1)anyΘ˜(1)anyΘ˜(1)Θ˜(1)
References[374][385][293], [303], [304][309][309][386], [387]

or Create an Account

Close Modal
Close Modal