Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval

d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More speci cally, based on the quadratic residuosity assumption, we present a single database, computationally-privateinformation-retrievalscheme with O(n ) communication complexity for any > 0.

• Type: Conference
• Year: 1997
• Where: FOCS
• Authors: Eyal Kushilevitz, Rafail Ostrovsky
• Keywords: Eyal Kushilevitz Rafail, FOCS 1997, Ostrovskyy Technion Bellcore, Quadratic Residuosity Assumption, Theoretical Computer Science