Journal
JOURNAL OF THE ACM
Volume 63, Issue 4, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2968443
Keywords
Private information retrieval; locally decodable codes
Categories
Funding
- NSF [CCF-1523816]
- Sloan fellowship
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1523816] Funding Source: National Science Foundation
Ask authors/readers for more resources
A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit database replicated among two noncommunicating servers, while not revealing any information about i to either server. In this work, we construct a 2-server PIR scheme with total communication cost n (O)(root loglog n / log n ). This improves over current 2-server protocols, which all require Omega(n(1/3)) communication. Our construction circumvents the n(1/3) barrier of Razborov and Yekhanin [2007], which holds for the restricted model of bilinear group-based schemes (covering all previous 2-server schemes). The improvement comes from reducing the number of servers in existing protocols, based on Matching Vector Codes, from 3 or 4 servers to 2. This is achieved by viewing these protocols in an algebraic way (using polynomial interpolation) and extending them using partial derivatives.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available