~/talk

Lower-Bounds on Public-Key Operations in PIR

Talkat Secure Computation 2025 · 2025-08-04..08-08· [cryptography]
links:none on file
slides:none on file

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

  1. 0:00Lower-bounds in PIR
  2. 1:04Simplest lower-bound consequences
  3. 4:55Sublinear public-key in PIR?
  4. 11:25Asymmetric PSI overhead
  5. 14:19OT extension fails for PIR
  6. 20:08Main result public-key PIR
  7. 23:24Simulatable oracles
  8. 27:35PIR protocol compilation
  9. 29:48PIR consequences open problems
  10. 32:39Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.