Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding

The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the databases. This assumption was also usually made in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information (Basel) Ročník 10; číslo 9; s. 265
Hlavní autoři: Sun, Hua, Tian, Chao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.09.2019
Témata:
capacity
Coding theory
Information retrieval
maximum distance separable codes
Messages
Privacy
private information retrieval
Queries
Storage
ISSN:2078-2489, 2078-2489
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the databases. This assumption was also usually made in other related works in the literature, and this capacity is usually referred to as the MDS-PIR capacity colloquially. In this work, we considered the question of if and when this capacity barrier can be broken through joint encoding and storing of the messages. Our main results are two classes of novel code constructions, which allow joint encoding, as well as the corresponding PIR protocols, which indeed outperformed the separate MDS-coded systems. Moreover, we show that a simple, but novel expansion technique allows us to generalize these two classes of codes, resulting in a wider range of the cases where this capacity barrier can be broken.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2078-2489
2078-2489
DOI:10.3390/info10090265