Article ID: 2020XBL0055
In private information retrieval (PIR) from coded storage servers, consider the case where some of servers are Byzantine adversaries and unresponsive. There have been proposed several specialized schemes guaranteeing that the user can correctly obtain the desired message even in the adversarial situation. However, to the best of our knowledge, such resistance to the adversaries in PIR schemes based on arbitrary codes have been not precisely characterized. In this paper, we reveal that the exact resistance to Byzantine and unresponsive servers is expressed in terms of the coset distance of linear codes in linear PIR schemes based on arbitrary storage code.