论文标题
索引编码中的信息泄漏，并使用敏感和不敏感的消息
Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages
论文作者
论文摘要
研究了索引编码中的猜测对手的信息泄漏，其中系统中的某些消息敏感而其他消息则不是。服务器可以像秘密密钥一样使用非敏感消息，以减轻对对手的敏感消息的泄漏。 We construct a deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to a novel upper bound on the optimal information leakage rate, which is proved to be tight over all deterministic scalar linear codes. We also derive a converse result from a graph-theoretic perspective, which holds in general over all deterministic and stochastic coding schemes.
Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the sensitive messages to the adversary. We construct a deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to a novel upper bound on the optimal information leakage rate, which is proved to be tight over all deterministic scalar linear codes. We also derive a converse result from a graph-theoretic perspective, which holds in general over all deterministic and stochastic coding schemes.
