Private Information Retrieval Schemes With Product-Matrix MBR Codes

Julien Lavauzelle, Razane Tajeddine*, Ragnar Freij-Hollanti, Camilla Hollanti

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes have been proposed for several kinds of storage systems, including replicated and MDS-coded systems. However, the problem of constructing PIR schemes on regenerating codes has been sparsely considered. A regenerating code is a storage code whose codewords are distributed among nodes, enabling efficient storage of files, as well as low-bandwidth retrieval of files and repair of nodes. Minimum-bandwidth regenerating (MBR) codes define a family of regenerating codes allowing a node repair with optimal bandwidth. Rashmi, Shah, and Kumar obtained a large family of MBR codes using the product-matrix (PM) construction. In this work, a new PIR scheme over PM-MBR codes is designed. The inherent redundancy of the PM structure is used to reduce the download communication complexity of the scheme. A lower bound on the PIR capacity of MBR-coded PIR schemes is derived, showing an interesting storage space vs. PIR rate trade-off compared to existing PIR schemes with the same reconstruction capability. The present scheme also outperforms a recent PM-MBR PIR construction of Dorkson and Ng.

Original languageEnglish
Article number9122048
Pages (from-to)441-450
Number of pages10
JournalIEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume16
DOIs
Publication statusPublished - 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Privacy
  • information retrieval
  • peer-to-peer computing
  • distributed databases
  • DISTRIBUTED STORAGE
  • CAPACITY

Cite this