Private Information Schemes Using Cyclic Codes
share
A Private Information Retrieval (PIR) scheme allows users to retrieve data from a database without disclosing to the server information about the identity of the data retrieved. A coded storage in a distributed storage system with colluding servers is considered in this work, namely the approach in [t-private information retrieval schemes using transitive codes, IEEE Trans. Inform. Theory, vol. 65, no. 4, pp. 2107-2118, 2019] which considers an storage and retrieval code with a transitive group and provides binary PIR schemes with the highest possible rate. Reed-Muller codes were considered in [t-private information retrieval schemes using transitive codes, IEEE Trans. Inform. Theory, vol. 65, no. 4, pp. 2107-2118, 2019], cyclic codes are considered in this work since they have a transitive group and can be defined over a binary field as well. We show that binary PIR schemes provide a larger constellation of PIR parameters and they outperform the ones coming from Reed-Muller codes in some cases.
READ FULL TEXT
