Preserving privacy while broadcasting: K-limited-access schemes

Mohammed Karmoose, Linqi Song, Martina Cardone, Christina Fragouli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can pose privacy concerns: it may enable clients to infer information about the requests and side information of other clients [1]. In this paper, we formalize the intuition that the achieved privacy can increase by decreasing the number of rows of the coding matrix that a client learns. Based on this, we propose the use of k-limited-access schemes: given an index coding scheme that employs T transmissions, we create a fc-limited-access scheme with Tk ≤ T transmissions, and with the property that each client learns at most k rows of the coding matrix to decode its message. We derive upper and lower bounds on Tk for all values of k, and develop deterministic designs for these schemes for which Tk has an order-optimal exponent for some regimes.

Original languageEnglish (US)
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages514-518
Number of pages5
ISBN (Electronic)9781509030972
DOIs
StatePublished - Jan 31 2018
Externally publishedYes
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: Nov 6 2017Nov 10 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-January
ISSN (Print)2157-8095

Other

Other2017 IEEE Information Theory Workshop, ITW 2017
CountryTaiwan, Province of China
CityKaohsiung
Period11/6/1711/10/17

Bibliographical note

Funding Information:
The work of the authors was partially funded by NSF under Awards 1423271, 1527550 and 1314937.

Funding Information:
The work of the authors was partially funded by NSF under Awards 1423271, 1527550 and 1314937. 1The coding matrix has size T × m and collects in each row the coding coefficients used for the corresponding broadcast transmission.

Fingerprint Dive into the research topics of 'Preserving privacy while broadcasting: K-limited-access schemes'. Together they form a unique fingerprint.

Cite this