Preserving privacy while broadcasting: K-limited-access schemes
Preserving privacy while broadcasting: K-limited-access schemes
复制标题
广播时保护隐私：K 限制访问方案
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
C. Fragouli
中科院分区：
文献类型：
--
作者：
Mohammed Karmoose;Linqi Song;Martina Cardone;C. Fragouli
索引编码采用跨同一广播域内的客户端的编码。这通常假设所有客户端都学习了编码矩阵，以便它们可以解码和检索其请求的数据。然而，学习编码矩阵可能会带来隐私问题：它可能使客户端能够推断有关其他客户端的请求和边信息的信息[1]。在本文中，我们形式化的直觉，实现的隐私可以通过减少客户端学习的编码矩阵的行数来增加。在此基础上，我们提出使用k-受限访问方案：给定采用T次传输的索引编码方案，我们创建具有Tk ≤ T次传输的fc-受限访问方案，并且具有每个客户端最多学习编码矩阵的k行以解码其消息的属性。我们推导出上，下界Tk的所有值的k，并制定确定性的设计这些计划，Tk有一个订单的最佳指数为某些制度。
Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can pose privacy concerns: it may enable clients to infer information about the requests and side information of other clients [1]. In this paper, we formalize the intuition that the achieved privacy can increase by decreasing the number of rows of the coding matrix that a client learns. Based on this, we propose the use of k-limited-access schemes: given an index coding scheme that employs T transmissions, we create a fc-limited-access scheme with Tk ≤ T transmissions, and with the property that each client learns at most k rows of the coding matrix to decode its message. We derive upper and lower bounds on Tk for all values of k, and develop deterministic designs for these schemes for which Tk has an order-optimal exponent for some regimes.