Frequency Estimation in the Shuffle Model with Almost a Single Message
Frequency Estimation in the Shuffle Model with Almost a Single Message
复制标题
几乎单个消息的 Shuffle 模型中的频率估计
DOI:
10.1145/3548606.3560608
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
K. Yi
中科院分区:
文献类型:
--
作者:
Qiyao Luo;Yilei Wang;K. Yi
We present a protocol in the shuffle model of differential privacy (DP) for the frequency estimation problem that achieves error ω(1) ⋅ O(log n), almost matching the central-DP accuracy, with 1 + o(1) messages per user. This exhibits a sharp transition phenomenon, as there is a lower bound of Ω (n1/4) if each user is allowed to send only one message. Previously, such a result is only known when the domain size B is o(n). For a large domain, we also need an efficient method to identify the heavy hitters (i.e., elements that are frequent enough). For this purpose, we design a shuffle-DP protocol that uses o(1) messages per user and can identify all heavy hitters in time polylogarithmic in B. Finally, by combining our frequency estimation and the heavy hitter detection protocols, we show how to solve the B-dimensional 1-sparse vector summation problem in the high-dimensional setting B=Ω(n), achieving the optimal central-DP MSE Õ(n) with 1 + o(1) messages per user. In addition to error and message number, our protocols improve in terms of message size and running time as well. They are also very easy to implement. The experimental results demonstrate order-of-magnitude improvement over prior work.
DOI:
10.4230/lipics.itc.2020.1
发表时间:
2019-11
期刊:
--
影响因子:
--
作者:
Victor Balcer;Albert Cheu
通讯作者:
Victor Balcer;Albert Cheu
DOI:
--
发表时间:
2017-08
期刊:
--
影响因子:
--
作者:
Tianhao Wang;Jeremiah Blocki;Ninghui Li;S. Jha
通讯作者:
Tianhao Wang;Jeremiah Blocki;Ninghui Li;S. Jha