|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
PIR Array Codes with Optimal PIR Rate | | Simon Blackburn
; Tuvi Etzion
; | | Date: |
1 Jul 2016 | | Abstract: | There has been much recent interest in Private information Retrieval (PIR) in
models where a database is stored across several servers using coding
techniques from distributed storage, rather than being simply replicated. In
particular, a recent breakthrough result of Fazelli, Vardy and Yaakobi
introduces the notion of a PIR array code, and uses this notion to produce
efficient protocols.
In this paper we are interested in designing PIR array codes with good
parameters. We consider the case when we have $m$ servers, with each server
storing a fraction $(1/s)$ of the bits of the database; here $s$ is a fixed
rational number with $s > 1$. We study the maximum PIR rate of a PIR array code
with the $k$-PIR property, where the PIR rate is defined to be $k/m$. We
present upper bounds on the achievable rate, some constructions, and ideas how
to obtain PIR array codes with high PIR rate. In particular, we present
constructions that asymptotically meet our upper bounds, and the exact largest
PIR rate is obtained when $1 < s leq 2$. Most, if not all, of our
constructions will make use of set systems, i.e. some type of block design. | | Source: | arXiv, 1607.0235 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER