all InfoSec news
Information Leakage in Index Coding. (arXiv:2205.10821v1 [cs.IT])
May 24, 2022, 1:20 a.m. | Yucheng Liu, Lawrence Ong, Phee Lep Yeoh, Parastoo Sadeghi, Joerg Kliewer, Sarah Johnson
cs.CR updates on arXiv.org arxiv.org
We study the information leakage to a guessing adversary in index coding with
a general message distribution. Under both vanishing-error and zero-error
decoding assumptions, we develop lower and upper bounds on the optimal leakage
rate, which are based on the broadcast rate of the subproblem induced by the
set of messages the adversary tries to guess. When the messages are independent
and uniformly distributed, the lower and upper bounds match, establishing an
equivalence between the two rates.
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 Compliance Architect - Experian Health (Can be REMOTE from anywhere in the US)
@ Experian | ., ., United States
IT Security Specialist
@ Ørsted | Kuala Lumpur, MY
Senior, Cyber Security Analyst
@ Peloton | New York City
Cyber Security Engineer | Perimeter | Firewall
@ Garmin Cluj | Cluj-Napoca, Cluj County, Romania
Pentester / Ethical Hacker Web/API - Vast/Freelance
@ Resillion | Brussels, Belgium