A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes

Suppose a database containing M records is replicated in each of N servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to T servers. A scheme designed for this purpose is called a T -private information retrieval (T -PIR) scheme.In this paper we focus on the field size of T -PIR schemes. We design a general capacity-achieving T -PIR scheme whose queries are generated by using some MDS array codes. It only requires field size $q \geq \sqrt[\ell ]{N}$, where ℓ = min {tM−2, (n − t)M−2}, t = T/gcd(N, T), n = N/gcd(N, T) and has the optimal sub-packetization NnM−2. Comparing with existing capacity-achieving T -PIR schemes, our scheme has the following advantage, that is, its field size monotonically decreases as the number of records M grows. In particular, the binary field is sufficient for building a capacity-achieving T-PIR scheme as long as M ≥ 2 + ⌈logµ log2 N⌉, where µ = min{t, n − t} > 1.

[1]  Sergey Yekhanin,et al.  Locally Decodable Codes and Private Information Retrieval Schemes , 2010, Information Security and Cryptography.

[2]  Yuval Ishai,et al.  Share Conversion and Private Information Retrieval , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[3]  Jingke Xu,et al.  Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[4]  Alexandre Graell i Amat,et al.  An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[5]  Jingke Xu,et al.  On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers , 2018, Science China Information Sciences.

[6]  Gennian Ge,et al.  A general private information retrieval scheme for MDS coded databases with colluding servers , 2017, Designs, Codes and Cryptography.

[7]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval From Coded Databases , 2016, IEEE Transactions on Information Theory.

[8]  Jingke Xu,et al.  The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers , 2019, IEEE Transactions on Information Theory.

[9]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[10]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2017, IEEE Transactions on Information Theory.

[11]  Hua Sun,et al.  The capacity of private information retrieval with colluding databases , 2016, 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[12]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[13]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[14]  Hua Sun,et al.  Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length , 2016, IEEE Transactions on Information Forensics and Security.

[15]  Camilla Hollanti,et al.  $t$ -Private Information Retrieval Schemes Using Transitive Codes , 2017, IEEE Transactions on Information Theory.