Breaking the Barrier for Information-Theoretic Private Information Retrieval
نویسندگان
چکیده
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, -server PIR protocols the database is replicated among servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of bits of data. For any fixed , the complexity of the best protocols prior to our work was
منابع مشابه
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity...
متن کاملOn Basing Private Information Retrieval on NP-Hardness
The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP ⊈ BPP is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an NP-hard problem to the task of breaking certain cryptographic schemes. We mak...
متن کاملDRAFT DRAFT DRAFT DRAFT DRAFT DRAFT DRAFT DRAFT An Improved Upper Bound for Information Theoretic Private Information Retrieval
The private information retrieval (PIR) primitive has received a significant amount of attention from the scientific community since it was first proposed by Chor et al. with other cryptographic primitives [6, 12] and improved upper bounds [3, 16] have been obtained. In this paper, we continue along this path and give an improved upper bound for information theoretic PIR. Our protocol and proof...
متن کاملImproved Upper Bounds on Information-theoretic Private Information Retrieval
Private Information Retrieval (PIR) schemes allow a user to retrieve the i-th bit of an n-bit database x, replicated in k servers, while keeping the value of i private from each server. A t-private PIR scheme protects the user's privacy from any collusion of up to t servers. The main cost measure for such schemes is their communication complexity. We introduce a new technique for the constructi...
متن کاملA T-private K-database Private Information Retrieval Scheme
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated databases. The scheme is information-theoretically secure against coalitions of databases of size t k ? 1. It improves the communication complexity of the scheme described in 12] for coalitions of ...
متن کامل