Web: http://arxiv.org/abs/2111.06833

Nov. 23, 2022, 2:20 a.m. | Qiyao Luo, Yilei Wang, Ke Yi

cs.CR updates on arXiv.org arxiv.org

We present a protocol in the shuffle model of differential privacy (DP) for
the \textit{frequency estimation} problem that achieves error $\omega(1)\cdot
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
$\Omega(n^{1/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 …

message shuffle single

Senior Cloud Security Engineer

@ HelloFresh | Berlin, Germany

Senior Security Engineer

@ Reverb | Remote, US

I.S. Security Analyst

@ YVFWC | Yakima, WA

Snr Professional Services Consultant - XSIAM

@ Palo Alto Networks | Madrid, Spain

Data Governor and Security Specialist

@ Dynatrace | Milan, Italy

Principal Windows Exploit Security Researcher (Cortex XDR)

@ Palo Alto Networks | Tel Aviv-Yafo, Israel

Information System Security Officer (ISSO)

@ SciTec | Boulder, Colorado, United States

Application Security Design Architect

@ Fivesky | Alpharetta, GA

Product Cybersecurity Lead

@ SciTec | Boulder, Colorado, United States

Cybersecurity Consultant

@ Sia Partners | Rotterdam, Netherlands

Senior Cybersecurity Engineer

@ Visa | Austin, TX, United States

Manager Pentest H/F

@ Hifield | Sèvres, France