Lower-Bounds on Public-Key Operations in PIR
summary
Proves a concrete barrier: any PIR without preprocessing that treats group/HomEnc-style primitives as a simulatable oracle forces the server to do a nearly linear amount of public-key work (query-size × query-count ≈ n), independent of symmetric-key effort. Shows a compilation that replaces S-oracle calls by having the receiver lazily simulate them, paying sender communication proportional to S-queries; derives communication lower-bounds for OT extension (IKNP optimal) and for general asymmetric 2PC. Notes LWE-style non-simulatable assumptions and preprocessing are outside the impossibility.
AI-written summary · about
chapters (10)
- 0:00Lower-bounds in PIR
- 1:04Simplest lower-bound consequences
- 4:55Sublinear public-key in PIR?
- 11:25Asymmetric PSI overhead
- 14:19OT extension fails for PIR
- 20:08Main result public-key PIR
- 23:24Simulatable oracles
- 27:35PIR protocol compilation
- 29:48PIR consequences open problems
- 32:39Q&A
related talks
01h 04mDoubly Efficient Private Information Retrieval
43mSingle-Server Private Information Retrieval with Sublinear Amortized Time
59mDoubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
01h 04mTutorial on obfuscation
58mObfuscation 2
01h 14mPrivate Information Retrieval and Oblivious RAM
57mIndistinguishability Obfuscation from Well-Founded Assumptions
01h 01mCircularity Based IO, Part 1
