Permuted puzzles ⇒ OLDC
Statement
Suppose the Permuted Low-Degree Polynomials Conjecture of BIPW17, an instance of the permuted-puzzles assumption, holds for a constant dimension : for a uniformly random permutation of , -images of random points on random degree- curves through chosen points are indistinguishable from uniformly random points of , over polynomially many samples (Conjecture 4.2). Then the Reed–Muller code, with , and its codeword positions permuted by a secret uniformly random , is a perfectly correct oblivious locally decodable code with communication complexity : to decode , the decoder reads the -images of random points on a random degree- curve through the -th of fixed points and interpolates — BIPW17 (Construction 4.1, Proposition 4.3). Its query sampler evaluates a degree- curve at points and its decoder interpolates at those points, in time , sublinear in for — folklore.
Notes
- BIPW17’s Construction 4.1 samples from a pseudorandom permutation, so that the key is short, and Proposition 4.3 derives its security from Conjecture 4.2, which is stated for a uniformly random — BIPW17. BIPW17 state Proposition 4.3 for every .
- The observer of an OLDC sees the positions read but neither the key nor the contents of the encoding — BIPW17. Masking the encoding with a pad in the key gives a passive-server SK-DEPIR (OLDC ⇒ Passive-server SK-DEPIR) — folklore.
- The conjecture is an instance of BIPW17’s Permuted Puzzle Conjecture (Conjecture 4.5) — BIPW17; the assumption family is formalized and studied as permuted puzzles — BHW19.
- An attack breaks the BIPW17 toy conjecture, a simplified variant posed for cryptanalysis, but not the assumption underlying the construction — BHMW21.