• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >The Capacity of Private Information Retrieval With Partially Known Private Side Information
【24h】

The Capacity of Private Information Retrieval With Partially Known Private Side Information

机译：使用部分已知的私人附带信息进行私人信息检索的能力

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non -colluding databases where a cache -enabled user (retriever) of cache -size M possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user downloads desired information. In the prefetching phase, the user receives tn full messages from the nth database, under the cache memory size constraint EnN inn < M. In the retrieval phase, the user wishes to retrieve a message (which is not present in its memory) such that no individual database learns anything about the identity of the desired message. In addition, the identities of the side information messages that the user did not prefetch from a database must remain private against that database. Since the side information provided by each database in the prefetching phase is known by the providing database and the side information must be kept private against the remaining databases, we coin this model as partially known private side information. We characterize the capacity of the PIR with partially known private side information to be C = 11 1-1 :v Interestingly, this N NK M-11 = 1 (1) result " result is the same if none of the databases knows any of the prefetched side information, i.e., when the side information is obtained externally, a problem posed by Kadhe et al. and settled by Chen-Wang-Jafar recently. Thus, our result implies that there is no loss in using the same databases for both prefetching and retrieval phases.
机译：我们考虑了来自N个复制数据库和非冲突数据库中K条消息中单个消息的私有信息检索（PIR）问题，在该数据库中，启用了缓存的大小为M的启用缓存的用户（检索者）拥有完整消息形式的边信息。数据库部分已知的功能。在该模型中，用户和数据库参与两个阶段的方案，即用户获取边信息的预取阶段和用户下载所需信息的检索阶段。在预取阶段，用户在高速缓存大小限制EnN inn

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号