恒定权重PIR：通过恒定权重等式运算符的单轮关键字PIR
Constant-weight PIR: Single-round Keyword PIR via Constant-weight Equality Operators
摘要：
相等运算符是安全计算任务（如私有信息检索）中的基本构建块。在私有信息检索（PIR）中，用户查询数据库，使得服务器不知道查询了哪个元素。在这项工作中，我们提出了\emph{equality operators for constant-weight codewords}。恒重码是共享相同汉明权重的码字的集合。常数权重相等运算符的乘法深度仅取决于代码的汉明权重，而不取决于元素的位长。在我们的实验中，我们展示了这些相等运算符是如何比现有的相等运算符快10倍。此外，我们提出了PIR使用恒定权重的等式运算符或\emph{constant-weight PIR}，这是一个PIR协议，使用以前被认为是不切实际的方法。我们发现，对于大型流数据的私人检索，恒定权重PIR具有较小的通信复杂性和较低的运行时间相比，SEALPIR和MulPIR，分别是两个国家的最先进的解决方案PIR。此外，我们展示了如何恒定权重PIR可以扩展到关键字PIR。在关键字PIR中，通过与所寻找的项目有关的唯一标识符来检索期望的元素，例如，一个文件的名字。先前的关键字PIR解决方案需要一轮或多轮通信来将问题减少到正常PIR。我们发现，恒定权重PIR是第一个实用的单轮解决方案，单服务器关键字PIR。
英文摘要：
Equality operators are an essential building block in tasks over secure computation such as private information retrieval. In private information retrieval (PIR), a user queries a database such that the server does not learn which element is queried. In this work, we propose \emph{equality operators for constant-weight codewords}. A constant-weight code is a collection of codewords that share the same Hamming weight. Constant-weight equality operators have a multiplicative depth that depends only on the Hamming weight of the code, not the bit-length of the elements. In our experiments, we show how these equality operators are up to 10 times faster than existing equality operators. Furthermore, we propose PIR using the constant-weight equality operator or \emph{constant-weight PIR}, which is a PIR protocol using an approach previously deemed impractical. We show that for private retrieval of large, streaming data, constant-weight PIR has a smaller communication complexity and lower runtime compared to SEALPIR and MulPIR, respectively, which are two state-of-the-art solutions for PIR. Moreover, we show how constant-weight PIR can be extended to keyword PIR. In keyword PIR, the desired element is retrieved by a unique identifier pertaining to the sought item, e.g., the name of a file. Previous solutions to keyword PIR require one or multiple rounds of communication to reduce the problem to normal PIR. We show that constant-weight PIR is the first practical single-round solution to single-server keyword PIR.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
