This website requires JavaScript.

Cache-Aided Multi-User Private Information Retrieval using PDAs

Kanishak VaidyaB Sundar Rajan
Dec 2022
摘要
We consider the problem of cache-aided multi-user private informationretrieval (MuPIR). In this problem, $N$ independent files are replicated across$S \geq 2$ non-colluding servers. There are $K$ users, each equipped with cachememory which can store $M$ files. Each user wants to retrieve a file from theservers, but the users don't want any of the servers to get any informationabout their demand. The user caches are filled with some arbitrary function ofthe files before the users decide their demands, known as the placement phase.After deciding their demands, users cooperatively send queries to the serversto retrieve their desired files privately. Upon receiving the queries, serversbroadcast coded transmissions which are a function of the queries they receivedand the files, known as the delivery phase. Conveying queries to the serversincurs an upload cost for the users, and downloading the answers broadcasted bythe servers incurs a download cost. To implement cache-aided MuPIR schemes,each file has to be split into $F$ packets. In this paper, we propose MuPIRschemes that utilize placement delivery arrays (PDAs) to characterize placementand delivery. Proposed MuPIR schemes significantly reduce subpacketizationlevels while slightly increasing the download cost. The proposed scheme alsosubstantially reduces the upload cost for the users. For PDAs based on {\itAli-Niesen} scheme for centralized coded caching, we show that our scheme isorder optimal in terms of download cost. We recover the optimal single-user PIRscheme presented by {\it Tian et al.} as a special case. Our scheme alsoachieves optimal rate for single-user cache-aided PIR setup reported by R.Tondon.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答