An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes
Paper in proceeding, 2018

We propose a private information retrieval (PIR) protocol for distributed storage systems (DSSs) with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved stored data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus PIR capacity-achieving.

PIR capacity

Private information retrieval

distributed storage

Author

Hsuan-Yin Lin

Simula UiB

Siddhartha Kumar

Simula UiB

Eirik Rosnes

Simula UiB

Alexandre Graell i Amat

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

Vol. 2018-June 966-970 8437804
978-1-5386-4781-3 (ISBN)

2018 IEEE International Symposium on Information Theory, ISIT 2018
Vail, USA,

Rethinking Distributed Storage for Data Storage and Wireless Content Delivery

Swedish Research Council (VR) (2016-04253), 2016-01-01 -- 2019-12-31.

Areas of Advance

Information and Communication Technology

Subject Categories

Telecommunications

Communication Systems

Signal Processing

Computer Systems

DOI

10.1109/ISIT.2018.8437804

More information

Latest update

7/17/2024