通过重采样增强单服务器场景下的TreePIR
Enhancing TreePIR for a Single-Server Setting via Resampling
AI总结:
本研究针对单服务器场景下的私有信息检索问题,基于TreePIR结合PIANO、PPPS的机制,提出双表提示结构与重采样技术,在保持弱密码假设的同时显著优化了带宽与存储开销。
摘要:
私有信息检索(Private Information Retrieval,PIR)允许客户端从一台或多台服务器持有的公共数据库$\text{DB}$中检索条目$\text{DB}[i]$,且不会泄露查询的索引$i$。传统PIR方案仅在强假设下才能实现亚线性的服务器计算量,例如存在多台不共谋的服务器,或是使用公钥密码学。为克服这些限制,预处理PIR方案引入了与查询无关的离线阶段,客户端在此阶段收集“提示”(hints),从而在在线阶段实现高效的私有查询。\n 在本研究中,我们聚焦于仅依赖单向函数(One-Way Functions,OWFs)的预处理PIR方案,这类方案的密码学假设最弱且具备实际可实现性。我们研究了三种主要构造——TreePIR、PIANO和PPPS,它们在通信开销、存储成本和服务器信任假设之间存在不同的权衡。基于PIANO和PPPS中提出的机制,我们通过引入双表提示结构(主表与备份表)以及一种可高效刷新提示的重采样技术,对TreePIR进行调整以适配单服务器场景。\n 我们提出的方案实现了对数级的上传带宽和$O(\n\log n)$的下载复杂度,同时仅需$O(\n\log n)$的客户端存储。与PIANO($O(\n)$带宽)和PPPS($O(n^{1/4})$带宽)等此前的单服务器预处理PIR方案相比,这是一项显著提升,同时还保持了基于OWF场景的简洁性与弱假设特性。
英文摘要:
Private Information Retrieval (PIR) allows a client to retrieve an entry $\text{DB}[i]$ from a public database $\text{DB}$ held by one or more servers, without revealing the queried index $i$. Traditional PIR schemes achieve sublinear server computation only under strong assumptions, such as the presence of multiple non-colluding servers or the use of public-key cryptography. To overcome these limitations, \textit{preprocessing PIR} schemes introduce a query-independent offline phase where the client collects \textit{hints} that enable efficient private queries during the online phase. In this work, we focus on preprocessing PIR schemes relying solely on \textit{One-Way Functions} (OWFs), which provide minimal cryptographic assumptions and practical implementability. We study three main constructions -- TreePIR, PIANO, and PPPS -- that explore different trade-offs between communication, storage, and server trust assumptions. Building upon the mechanisms introduced in PIANO and PPPS, we propose an adaptation of TreePIR to the single-server setting by introducing a dual-table hint structure (primary and backup tables) and a \textit{resampling} technique to refresh hints efficiently. Our proposed scheme achieves logarithmic upload bandwidth and $O(\sqrt{n}\log n)$ download complexity while requiring $O(\sqrt{n}\log n)$ client storage. This represents a significant improvement over prior single-server preprocessing PIR schemes such as PIANO ($O(\sqrt{n})$ bandwidth) and PPPS ($O(n^{1/4})$ bandwidth), while maintaining the simplicity and minimal assumptions of the OWF-based setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。