Reducing the servers' computation in private information retrieval: PIR with preprocessing

Amos Beimel; Yuval Ishai; Tal Malkin

doi:10.1007/s00145-004-0134-y

Reducing the servers' computation in private information retrieval: PIR with preprocessing

Amos Beimel, Yuval Ishai, Tal Malkin

Computer Science

Research output: Contribution to journal › Article › peer-review

55 Scopus citations

Abstract

The computational complexity of private information retrieval (PIR) was studied. It was shown that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. Substantial savings in the amount of computation without severely affecting the communication complexity are obtained by using preprocessing in PIR protocols. Two alternative models to saving computation, by batching queries and by allowing a separate off-line interaction per future query were suggested.

Original language	English
Pages (from-to)	125-151
Number of pages	27
Journal	Journal of Cryptology
Volume	17
Issue number	2
DOIs	https://doi.org/10.1007/s00145-004-0134-y
State	Published - Mar 2004

Keywords

Distributed databases
Information-theoretic protocols
Privacy
Sub-linear communication
Sub-linear computation

ASJC Scopus subject areas

Software
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00145-004-0134-y

Cite this

@article{e4533979d9274434adda9e30fa72853e,

title = "Reducing the servers' computation in private information retrieval: PIR with preprocessing",

abstract = "The computational complexity of private information retrieval (PIR) was studied. It was shown that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. Substantial savings in the amount of computation without severely affecting the communication complexity are obtained by using preprocessing in PIR protocols. Two alternative models to saving computation, by batching queries and by allowing a separate off-line interaction per future query were suggested.",

keywords = "Distributed databases, Information-theoretic protocols, Privacy, Sub-linear communication, Sub-linear computation",

author = "Amos Beimel and Yuval Ishai and Tal Malkin",

year = "2004",

month = mar,

doi = "10.1007/s00145-004-0134-y",

language = "אנגלית",

volume = "17",

pages = "125--151",

number = "2",

}

TY - JOUR

T1 - Reducing the servers' computation in private information retrieval

T2 - PIR with preprocessing

AU - Beimel, Amos

AU - Ishai, Yuval

AU - Malkin, Tal

PY - 2004/3

Y1 - 2004/3

N2 - The computational complexity of private information retrieval (PIR) was studied. It was shown that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. Substantial savings in the amount of computation without severely affecting the communication complexity are obtained by using preprocessing in PIR protocols. Two alternative models to saving computation, by batching queries and by allowing a separate off-line interaction per future query were suggested.

AB - The computational complexity of private information retrieval (PIR) was studied. It was shown that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. Substantial savings in the amount of computation without severely affecting the communication complexity are obtained by using preprocessing in PIR protocols. Two alternative models to saving computation, by batching queries and by allowing a separate off-line interaction per future query were suggested.

KW - Distributed databases

KW - Information-theoretic protocols

KW - Privacy

KW - Sub-linear communication

KW - Sub-linear computation

UR - http://www.scopus.com/inward/record.url?scp=4344573261&partnerID=8YFLogxK

U2 - 10.1007/s00145-004-0134-y

DO - 10.1007/s00145-004-0134-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:4344573261

SN - 0933-2790

VL - 17

SP - 125

EP - 151

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 2

ER -

Reducing the servers' computation in private information retrieval: PIR with preprocessing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this