all InfoSec news
Smooth Anonymity for Sparse Binary Matrices. (arXiv:2207.06358v1 [cs.CR])
July 14, 2022, 1:20 a.m. | Hossein Esfandiari, Alessandro Epasto, Vahab Mirrokni, Andres Munoz Medina, Sergei Vassilvitskii
cs.CR updates on arXiv.org arxiv.org
When working with user data providing well-defined privacy guarantees is
paramount. In this work we aim to manipulate and share an entire sparse dataset
with a third party privately. In fact, differential privacy has emerged as the
gold standard of privacy, however, when it comes to sharing sparse datasets, as
one of our main results, we prove that \emph{any} differentially private
mechanism that maintains a reasonable similarity with the initial dataset is
doomed to have a very weak privacy guarantee. …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Security Engineering Professional
@ Nokia | India
Cyber Intelligence Exercise Planner
@ Peraton | Fort Gordon, GA, United States
Technical Lead, HR Systems Security
@ Sun Life | Sun Life Wellesley
SecOps Manager *
@ WTW | Thane, Maharashtra, India
Consultant Appels d'Offres Marketing Digital
@ Numberly | Paris, France