arXiv (Cornell University) · 2019 · 22 citations · 25 references
EngineeringComputer ScienceCryptographyDigital CommunicationInformation TheoryChannel CapacityCoding TheoryCodes Over Finite FieldsCryptographic CapacityInformation-theoretic Secrecy CapacityInterference CancellationLinearityPrivate Information RetrievalStrong Converse TheoremSubpacketization
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived, as well as the capacity of symmetric, linear PIR with colluding, adversarial, and nonresponsive servers for the recently introduced concept of matched randomness. This positively settles the capacity conjectures stated by Freij-Hollanti et al. and Tajeddine et al. in the presented cases. It is also shown that, further restricting to strongly-linear PIR schemes with deterministic linear interference cancellation, the so-called star product scheme proposed by Freij-Hollanti et al. is essentially optimal and induces no capacity loss.
25
Benny Chor, Oded Goldreich, Eyal Kushilevitz et al. · 2002 · 1.1K citations
The Capacity of Private Information Retrieval
Hua Sun, Syed A. Jafar · IEEE Transactions on Information Theory · 2017 · 461 citations
Protecting data privacy in private information retrieval schemes
Yael Gertner, Yuval Ishai, Eyal Kushilevitz et al. · 1998 · 451 citations · Full text