论文标题
私人信息从与二进制芦苇卷代码相交和拜占庭式服务器中检索
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes
论文作者
论文摘要
在这项工作中，考虑了基于二进制非最大距离可分离（非MD）代码的灵活且健壮的私人信息检索（PIR）方案。这结合了先前基于PIR方案的作品，一方面是基于传递非MDS代码的PIR方案，另一方面是MDS编码的byzantine和非反应性服务器的PIR。更具体地说，构建了采用二进制芦苇螺栓（RM）代码的PIR方案，构建了对勾结，拜占庭式和非响应服务器的耐受性，并且在某些条件下得出了可实现速率的界限。事实证明，此类方案的构建比MDS代码要多得多。也就是说，必须非常小心地选择二进制查询向量，以达到所需的信息集，这在技术上具有挑战性。
In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous works on PIR schemes based on transitive non-MDS codes on one hand, and PIR from MDS-coded Byzantine and non-responsive servers on the other hand. More specifically, a PIR scheme employing binary Reed-Muller (RM) codes tolerant to colluding, Byzantine, and non-responsive servers is constructed, and bounds for the achievable rates are derived under certain conditions. The construction of such schemes turns out to be much more involved than for MDS codes. Namely, the binary query vectors have to be selected with great care to hit the desired information sets, which is technically challenging as will be shown.
