all InfoSec news
Tight Differential Privacy Guarantees for the Shuffle Model with $k$-Randomized Response
May 1, 2024, 4:11 a.m. | Sayan Biswas, Kangsoo Jung, Catuscia Palamidessi
cs.CR updates on arXiv.org arxiv.org
Abstract: Most differentially private (DP) algorithms assume a central model in which a reliable third party inserts noise to queries made on datasets, or a local model where the users locally perturb their data. However, the central model is vulnerable via a single point of failure, and in the local model, the utility of the data deteriorates significantly. The recently proposed shuffle model is an intermediate framework between the central and the local paradigms where the …
algorithms arxiv cs.cr data datasets differential privacy local locally noise party point privacy private response shuffle single third vulnerable
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Sr. Product Manager
@ MixMode | Remote, US
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Incident Response Lead(IR)
@ Blue Yonder | Hyderabad
Comcast Cybersecurity: Privacy Operations Executive Director
@ Comcast | PA - Philadelphia, 1701 John F Kennedy Blvd