Secure Index Coding with Side Information

Details Secure Index Coding with Side Information Secure Index Coding with Side Information

2010-11-25

arxiv.org/abs/1011.5566v1

Computer Science

Information Theory

8 pages

Scientific paper

Security aspects of the Index Coding with Side Information (ICSI) problem are investigated. Building on the results of Bar-Yossef et al. (2006), the properties of linear coding schemes for the ICSI problem are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the coding scheme for the ICSI problem based on a linear code C of length n, minimum distance d and dual distance d^\perp, is (d-1-t)-block secure (and hence also weakly secure) if the adversary knows in advance t \le d - 2 messages, and is completely insecure if the adversary knows in advance more than n - d^\perp messages.

Affiliated with

Also associated with

No associations

Rating

Secure Index Coding with Side Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Index Coding with Side Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Index Coding with Side Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587630