SPIDER: Two Server Functionality for the Cost of Zero
Ofir Dvir, Kali Hale, Javin Zipkin, Divyakant Agrawal, Dahlia Malkhi

TL;DR
The paper introduces SPIDER, a novel single-server private information retrieval scheme that simplifies design and improves practicality by eliminating the need for server cooperation or specialized APIs.
Contribution
It presents baseSPIDER with optimal communication complexity and a new SPIDER scheme that operates over default database interfaces, broadening PIR applicability.
Findings
baseSPIDER matches asymptotic optimal communication complexity
SPIDER achieves privacy without server cooperation or specialized APIs
The transformation applies to recent PIR solutions, simplifying deployment
Abstract
We introduce baseSPIDER and SPIDER, private information retrieval (PIR) schemes that embody two technical advancements. The baseSPIDER protocol operates with a single server and a stateful client that performs pre-processing and stores hints for future queries. In this setting, baseSPIDER introduces a new approach that matches the asymptotically optimal communication complexity of state-of-the-art schemes while improving constant factors--an advantage that is particularly significant for databases with large entries. In addition, baseSPIDER offers a conceptually simpler design relative to prior protocols. SPIDER operates over a default database interface and requires no cooperation from the server at any stage. To our knowledge, SPIDER is the first single-server PIR construction of this design, achieving privacy without specialized APIs, auxiliary server state, or protocol-specific…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
