arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.16700cs.ITcs.CRcs.NIeess.SPmath.IT
收藏

对称PIR中公共随机性复制的作用:基于图的复制系统

The Role of Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems

University of Maryland, College Park(马里兰大学帕克分校)

Shreya Meel, Sennur Ulukus

AI总结:

本文研究了基于图的复制系统中对称PIR的公共随机性复制作用,分析了两种公共随机性分配方式对SPIR容量的影响,并证明了实现SPIR所需的最小公共随机性大小等于消息大小。

摘要:

在对称私有信息检索(SPIR)中,用户通过多个服务器检索数据库中的消息,同时不向任何单个服务器泄露消息索引(用户隐私),并且不获取数据库的额外信息(数据库隐私)。我们研究了在图复制数据库系统中的SPIR问题,其中每个节点代表一个服务器,每个链接代表一条消息。每条消息恰好复制在两个服务器上,即链接所连接的服务器。为了确保数据库隐私,服务器共享一组公共随机性,这与数据库和用户所请求的消息索引无关。我们研究了公共随机性分配给服务器的两种情况:i)图复制公共随机性,和ii)完全复制公共随机性。给定一个图复制数据库系统,在i)中,我们为每对共享消息的服务器分配一个独立的随机变量,而在ii)中,我们为所有服务器分配一个相同集的随机变量,无论底层图结构如何。在两种设置中,我们的目标是确定SPIR容量,即每下载一个符号所能检索的所需消息符号的最大数量,并量化实现容量所需的最小公共随机性量。为此,在i)中,我们推导出SPIR容量的一般下界,并通过匹配反向证明该下界在路径图和正则图中是紧的。此外,我们证明实现SPIR所需的最小公共随机性大小等于消息大小。在ii)中,SPIR容量在第一种更严格的设置上有所提高。我们通过为一类图构造SPIR方案来展示这一点,这些方案基于PIR方案。

英文摘要:

In symmetric private information retrieval (SPIR), a user communicates with multiple servers to retrieve from them a message in a database, while not revealing the message index to any individual server (user privacy), and learning no additional information about the database (database privacy). We study the problem of SPIR on graph-replicated database systems, where each node of the graph represents a server and each link represents a message. Each message is replicated at exactly two servers; those at which the link representing the message is incident. To ensure database privacy, the servers share a set of common randomness, independent of the database and the user's desired message index. We study two cases of common randomness distribution to the servers: i) graph-replicated common randomness, and ii) fully-replicated common randomness. Given a graph-replicated database system, in i), we assign one randomness variable independently to every pair of servers sharing a message, while in ii), we assign an identical set of randomness variable to all servers, irrespective of the underlying graph. In both settings, our goal is to characterize the SPIR capacity, i.e., the maximum number of desired message symbols retrieved per downloaded symbol, and quantify the minimum amount of common randomness required to achieve the capacity. To this goal, in setting i), we derive a general lower bound on the SPIR capacity, and show it to be tight for path and regular graphs through a matching converse. Moreover, we establish that the minimum size of common randomness required for SPIR is equal to the message size. In setting ii), the SPIR capacity improves over the first, more restrictive setting. We show this through capacity lower bounds for a class of graphs, by constructing SPIR schemes from PIR schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑