论文标题
安全的索引编码，并在接收器上使用安全性约束
Secure Index Coding with Security Constraints on Receivers
论文作者
论文摘要
索引编码涉及在有接收器侧信息的情况下向接收器的一组消息的有效广播。在本文中，我们研究了对接收器本身的安全限制的安全索引编码问题。也就是说，对于每个接收器，都需要解码一个合法的消息和一个禁止的消息列表，没有该消息应由该接收器解码。为此，我们的贡献是三倍。我们首先引入了一个安全的线性编码方案，该方案是最初为非安全索引编码设计的分数本地部分集团覆盖方案的扩展版本。然后，我们开发了两个有关任何有效安全索引代码的性能的信息理论界限，即安全性多功能外部界限（在容量区域），并确保最大无环诱导子图下限（在广播速率上）。这些界限的结构使我们进一步为给定的索引编码问题提供了两个必要条件，以牢固可行（即具有非零率）。
Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers themselves. That is, for each receiver there is a single legitimate message it needs to decode and a prohibited message list, none of which should be decoded by that receiver. To this end, our contributions are threefold. We first introduce a secure linear coding scheme, which is an extended version of the fractional local partial clique covering scheme that was originally devised for non-secure index coding. We then develop two information-theoretic bounds on the performance of any valid secure index code, namely secure polymatroidal outer bound (on the capacity region) and secure maximum acyclic induced subgraph lower bound (on the broadcast rate). The structure of these bounds leads us to further develop two necessary conditions for a given index coding problem to be securely feasible (i.e., to have nonzero rates).
