Single-Server Individually-Private Information Retrieval: A Combinatorial Approach

2021 IEEE Information Theory Workshop (ITW)(2021)

引用 3|浏览0
暂无评分
摘要
This paper considers the problem of single-server Individually-Private Information Retrieval (IPIR). In this problem, a user wants to retrieve D messages belonging to a dataset of K messages stored on a single server. Initially, the user knows M other messages belonging to the dataset as side information, where the identities of these M messages are unknown to the server. The goal is to minimize t...
更多
查看译文
关键词
Upper bound,Conferences,Probabilistic logic,Information retrieval,Servers,Information theory,Capacity planning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要