Aug. 19, 2022, 1:20 a.m. | Albert Cheu, Chao Yan

cs.CR updates on arXiv.org arxiv.org

We consider protocols where users communicate with multiple servers to
perform a computation on the users' data. An adversary exerts semi-honest
control over many of the parties but its view is differentially private with
respect to honest users. Prior work described protocols that required multiple
rounds of interaction or offered privacy against a computationally bounded
adversary. Our work presents limitations of non-interactive protocols that
offer privacy against unbounded adversaries. We show these protocols demand
exponentially more samples for some learning …

conditions differential privacy privacy server

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Information Security Consultant

@ Auckland Council | Central Auckland, NZ, 1010

Security Engineer, Threat Detection

@ Stripe | Remote, US

DevSecOps Engineer (Remote in Europe)

@ CloudTalk | Prague, Prague, Czechia - Remote

Security Architect

@ Valeo Foods | Dublin, Ireland

Security Specialist - IoT & OT

@ Wallbox | Barcelona, Catalonia, Spain