March 15, 2023, 1:10 a.m. | Sara Saeidian (1), Giulia Cervia (2), Tobias J. Oechtering (1), Mikael Skoglund (1) ((1) KTH Royal Institute of Technology, (2) IMT Nord Europe)

cs.CR updates on arXiv.org arxiv.org

We investigate the possibility of guaranteeing inferential privacy for
mechanisms that release useful information about some data containing sensitive
information, denoted by $X$. We describe a general model of utility and privacy
in which utility is achieved by disclosing the value of low-entropy features of
$X$, while privacy is maintained by keeping high-entropy features of $X$
secret. Adopting this model, we prove that meaningful inferential privacy
guarantees can be obtained, even though this is commonly considered to be
impossible by …

data database entropy features general high information low meaningful privacy prove release secret sensitive information utility value

Security Analyst

@ Northwestern Memorial Healthcare | Chicago, IL, United States

GRC Analyst

@ Richemont | Shelton, CT, US

Security Specialist

@ Peraton | Government Site, MD, United States

Information Assurance Security Specialist (IASS)

@ OBXtek Inc. | United States

Cyber Security Technology Analyst

@ Airbus | Bengaluru (Airbus)

Vice President, Cyber Operations Engineer

@ BlackRock | LO9-London - Drapers Gardens