Article
Licensed
Unlicensed
Requires Authentication
The order of communication complexity of PIR-protocols
-
G. A. Maylybaeva
Published/Copyright:
December 15, 2008
Abstract
Private information retrieval protocols (PIR-protocols) allow a user to get the desired bit of information from a database whose copy is stored in several non-linked servers in such a way that the administrators of the database know nothing about the index of the bit the user requests for. The communication complexity of a protocol is defined as the total number of the bits exchanged between the user and the servers in the protocol. In this paper, we find the order of communication complexity of PIR-protocols depending on the degree of essentiality of the server response functions.
Received: 2006-08-03
Published Online: 2008-12-15
Published in Print: 2008-December
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
Articles in the same Issue
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
