加权提升码:局部可纠正性及其在鲁棒私有信息检索中的应用
Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval
AI总结:
本文提出加权提升码,通过改进维度和抵御合谋服务器能力,实现最优计算复杂度的PIR协议。
摘要:
低次Reed-Muller码已知具有局部解码性质,这些性质在私有信息检索(PIR)协议中有应用,例如。然而,其实际应用却面临第一个障碍,即在低次域中信息率较差。这促使社区设计具有类似局部性质但更大维度的码,即提升的Reed-Solomon码。然而,当要求PIR协议能够抵御服务器合谋时,又会出现第二个实际障碍。在本文中,我们通过考虑加权Reed-Muller码来解决这个问题。我们证明,此类码允许我们构建具有最优计算复杂度且能抵御少量合谋服务器的PIR协议。为了提高码的维度,我们随后引入了加权度的提升过程的类比。通过对其度集的仔细分析,我们证明加权提升的Reed-Solomon码会产生具有显著渐近参数的码族。
英文摘要:
Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance. However, their practical instantiation encounters a first barrier due to their poor information rate in the low degree regime. This lead the community to design codes with similar local properties but larger dimension, namely the lifted Reed-Solomon codes. However, a second practical barrier appears when one requires that the PIR protocol resists collusions of servers. In this paper, we propose a solution to this problem by considering \emph{weighted} Reed-Muller codes. We prove that such codes allow us to build PIR protocols with optimal computation complexity and resisting to a small number of colluding servers. In order to improve the dimension of the codes, we then introduce an analogue of the lifting process for weigthed degrees. With a careful analysis of their degree sets, we notably show that the weighted lifting of Reed-Solomon codes produces families of codes with remarkable asymptotic parameters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。