Private Information Retrieval

DMCA

Private Information Retrieval

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Benny Chor, et al.

Citations:

555 - 14 self

BibTeX

@MISC{Chor_privateinformation,
    author = {Benny Chor and et al.},
    title = {Private Information Retrieval},
    year = {}
}

OpenURL

Abstract

We describe schemes that enable a user to access k replicated copies of a database ( k * 2) and privately retrieve informationstored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving this type of privacy requires communicating the whole database, or n bits (where n is the number of bits in the database). Our schemes use the replication to gain substantial saving. In particular, we have ffl A two database scheme with communication complexity of O(n1=3).ffl

Keyphrases

constant number commu-nication complexity database scheme individual database single database communication complexity whole database repli-cated copy

DMCA