Work

Private Index Coding

Year: 2018

Type: conference-paper

Abstract: We study the problem of index coding under the privacy requirement that receivers do not learn anything more than the messages they already have as side information and the message they want from the server. To achieve this private index coding, we consider the use of secret keys that are shared among various subsets of users and the server. We characterize key access structures that allow private index coding. For up to three receivers, we characterize the rate region of transmission and key rates and show that scalar coding is optimal; we also show that scalar linear codes are sub-optimal for four receivers. Furthermore, when no keys are available, we consider a weaker notion of privacy analogous to weak security. Finally, for a different setting in which the server is allowed to send messages exclusively to a subset of users, we study the number of transmissions required to achieve error-free decoding and privacy.

Source: IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit.2018.8437353

Authors: Varun Narayanan, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash K. Dey, Nikhil Karamchandani

Institutions: Tata Institute of Fundamental Research, Universidad Carlos III de Madrid, Indian Institute of Technology Bombay

Language: English

Topic: Cryptography and Data Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Tata Institute of Fundamental Research, Indian Institute of Technology Bombay, H2020 European Research Council

Award: Information Theory for Low-Latency Wireless Communications