Private Locally Decodable Codes

We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we construct efficient locally decodable codes with positive information rate and low (almost optimal) query complexity which can correctly decode any given bit of the message from constant channel error rate ρ. This compares favorably to our state of knowledge locally-decodable codes without cryptographic assumptions. For all our constructions, the probability for any polynomial-time adversary, that the decoding algorithm incorrectly decodes any bit of the message is negligible in the security parameter.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Rafail Ostrovsky, Omkant Pandey, Amit Sahai
• Keywords: Channel Error Rate, Decodable Codes, ICALP 2007, Locally Decodable, Theoretical Computer Science