arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.12286cs.ITmath.IT
收藏

私有信息检索的线性规划方法

A Linear Programming Approach to Private Information Retrieval

Anoosheh Heidarzadeh, Ningze Wang, Alex Sprintson

AI总结:

提出基于线性规划的算法框架,用于构造仅用加法运算的AB-PIR方案,可覆盖全部参数范围并优化性能,且能集成到相关PIR场景中提升整体效果。

摘要:

本文提出了一种算法框架,利用线性规划来构造基于加法的私有信息检索(AB-PIR)方案,其中检索仅通过下载消息符号的线性组合(系数设为0或1)来完成。AB-PIR方案推广了若干现有的容量可达PIR方案,并具有实际意义,因为它们仅使用加法运算——避免了乘法及其他复杂运算——并且兼容任何有限域,包括二进制域。我们的框架将搜索空间扩展至包含所有可行解,并可用于为整个问题参数范围(包括服务器数量、消息总数以及需要检索的消息数量)构造最优AB-PIR方案。该框架使我们能够识别出在某些情况下优于先前提出的PIR方案的方案,并在其他情况下达到与已知最佳AB-PIR解决方案相当的性能。此外,由我们的框架生成的方案可以集成到若干相关PIR场景的现有解决方案中,从而提升其整体性能。

英文摘要:

This work presents an algorithmic framework that uses linear programming to construct \emph{addition-based Private Information Retrieval (AB-PIR)} schemes, where retrieval is performed by downloading only linear combinations of message symbols with coefficients set to 0 or 1. The AB-PIR schemes generalize several existing capacity-achieving PIR schemes and are of practical interest because they use only addition operations -- avoiding multiplication and other complex operations -- and are compatible with any finite field, including binary. Our framework broadens the search space to include all feasible solutions and can be used to construct optimal AB-PIR schemes for the entire range of problem parameters, including the number of servers, the total number of messages, and the number of messages that need to be retrieved. The framework enables us to identify schemes that outperform the previously proposed PIR schemes in certain cases and, in other cases, achieve performance on par with the best-known AB-PIR solutions. Additionally, the schemes generated by our framework can be integrated into existing solutions for several related PIR scenarios, improving their overall performance.

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

↑