Private information retrieval (PIR) lets a client fetch an item from a database without revealing which item it wants. Most practical schemes rely on multiple non-colluding servers, and reducing the number of servers while keeping communication low has been a long-standing challenge.

The new paper shows that, under a plausible number-theoretic conjecture, for any constant number of servers s, there exists an s-server PIR protocol for an n-bit database with communication cost that grows only as exp(O((log n)^c)) for some small exponent. This is a dramatic improvement over earlier constructions that required many more servers or much larger communication.

The key technical innovation is the use of sparser S-decoding polynomials, which allow the protocol to encode and decode queries more efficiently. The authors note that the result is conditional on the conjecture, so the practical impact depends on whether that conjecture is eventually proven.

Because this is a single source, there are no conflicting findings to compare. The result is presented as a theoretical advance, with the main caveat being its reliance on an unproven number-theoretic assumption.