ML p(r)ior | Secure Index Coding: Existence and Construction

Secure Index Coding: Existence and Construction

2016-02-02
We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of index codes that are secure against an eavesdropper with access to any subset of messages of cardinality $t$, for any fixed $t$. In contrast to the benefits of using random keys in secure network coding, we prove that random keys do not promote security in three classes of index-coding instances.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2019-05-07

We study medium access control layer random access under the assumption that the receiver can perfor… show more
PDF

Highlights - Most important sentences from the article

2019-03-19
1903.08229 | cs.IT

We consider constructing capacity-achieving linear codes with minimum message size for private infor… show more
PDF

Highlights - Most important sentences from the article

2018-11-22
1811.09142 | cs.IT

Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e.… show more
PDF

Highlights - Most important sentences from the article

2016-08-12
1608.03689 | cs.IT

The index coding problem studies the fundamental limit on broadcasting multiple messages to their re… show more
PDF

Highlights - Most important sentences from the article

2019-04-09

An index code for a broadcast channel with receiver side information is 'locally decodable' if every… show more
PDF

Highlights - Most important sentences from the article

2018-11-13
1811.05794 | cs.IT

A single unicast index coding problem (SUICP) is called symmetric neighboring and consecutive (SNC) … show more
PDF

Highlights - Most important sentences from the article

2019-01-20
1901.06741 | cs.IT

A primitive $k$-batch code encodes a string $x$ of length $n$ into string $y$ of length $N$, such th… show more
PDF

Highlights - Most important sentences from the article

2019-03-05

The decentralized coded caching was introduced in [M.~A. Maddah-Ali and U.~Niesen, `Decentralized co… show more
PDF

Highlights - Most important sentences from the article

2018-08-22
1808.07536 | cs.IT

We propose a new capacity-achieving code for the private information retrieval (PIR) problem, and sh… show more
PDF

Highlights - Most important sentences from the article

2019-04-04

The two-sender unicast index coding problem is the most fundamental multi-sender index coding proble… show more
PDF

Highlights - Most important sentences from the article

2019-01-17

An index code is said to be locally decodable if each receiver can decode its demand using its side … show more
PDF

Highlights - Most important sentences from the article

2017-12-25
1712.09035 | cs.IT

We analyze the security for network code when the eavesdropper can contaminate the information on th… show more
PDF

Highlights - Most important sentences from the article

2018-09-10

We study the index coding problem in the presence of an eavesdropper, where the aim is to communicat… show more
PDF

Highlights - Most important sentences from the article

2017-01-14
1701.03877 | cs.IT

In this paper, we propose a new coding scheme and establish new bounds on the capacity region for th… show more
PDF

Highlights - Most important sentences from the article

2019-01-22
1901.07136 | cs.IT

In this paper, linear index codes with multiple senders are studied, where every receiver receives e… show more
PDF

Highlights - Most important sentences from the article

2019-01-21
1901.07123 | cs.IT

A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has $K$ … show more
PDF

Highlights - Most important sentences from the article