How to Correct Errors in Multi-server PIR
| Autor: | Kaoru Kurosawa |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Multi server
Discrete mathematics 010201 computation theory & mathematics Server 0202 electrical engineering electronic engineering information engineering Error correcting 020206 networking & telecommunications Data_CODINGANDINFORMATIONTHEORY 0102 computer and information sciences 02 engineering and technology 01 natural sciences Decoding methods Mathematics |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030346201 ASIACRYPT (2) |
| DOI: | 10.1007/978-3-030-34621-8_20 |
| Popis: | Suppose that there exist a user and \(\ell \) servers \(S_1,\ldots ,S_{\ell }\). Each server \(S_j\) holds a copy of a database \(\mathbf {x}=(x_1, \ldots , x_n) \in \{0,1\}^n\), and the user holds a secret index \(i_0 \in \{1, \ldots , n\}\). A b error correcting \(\ell \) server PIR (Private Information Retrieval) scheme allows a user to retrieve \(x_{i_0}\) correctly even if and b or less servers return false answers while each server learns no information on \(i_0\) in the information theoretic sense. Although there exists such a scheme with the total communication cost \( O(n^{1/(2k-1)} \times k\ell \log {\ell } ) \) where \(k=\ell -2b\), the decoding algorithm is very inefficient. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|