Single-Server Private Information Retrieval with Sublinear Amortized Time
Name
Henzinger-ahenz-SM-EECS-2022-thesis.pdf
Description
Thesis PDF
Size
711.7 KB
Format
Adobe PDF
Checksum (MD5)
e59d537d16f02a09c84cde400e6ea684
Author(s)
Henzinger, Alexandra
Advisor(s)
Corrigan-Gibbs, Henry
Date Issued
May 2022
Publisher
Massachusetts Institute of Technology
Abstract
We construct new private-information-retrieval protocols in the singleserver setting. Our schemes allow a client to privately fetch a sequence of database records from a server, while the server answers each query in average time sublinear in the database size. Specifically, we introduce the first single-server private-information-retrieval schemes that have sublinear amortized server time, require sublinear additional storage, and allow the client to make her queries adaptively. Our protocols rely only on standard cryptographic assumptions (decision Diffie-Hellman, quadratic residuosity, learning with errors, etc.). They work by having the client first fetch a small “hint” about the database contents from the server. Generating this hint requires server time linear in the database size. Thereafter, the client can use the hint to make a bounded number of adaptive queries to the server, which the server answers in sublinear time—yielding sublinear amortized cost. Finally, we give lower bounds proving that our most efficient scheme is optimal with respect to the trade-off it achieves between server online time and client storage.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
