Public Key Locally Decodable Codes with Short Keys

This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channel as an adversary which is restricted to polynomial-time computation. Assuming the existence of IND-CPA secure public-key encryption, we present a construction of public-key locally decodable codes, with constant codeword expansion, tolerating constant error rate, with locality O(λ), and negligible probability of decoding failure, for security parameter λ. Hemenway and Ostrovsky gave a construction of locally decodable codes in the public-key model with constant codeword expansion and locality O(λ2 ), but their construction had two major drawbacks. The keys in their scheme were proportional to n, the length of the message, and their schemes were based on the Φ-hiding assumption. Our keys are of length proportional to the security parameter instead of the message, and our construction relies only on the ex...

• Type: Journal
• Year: 2011
• Where: APPROX
• Authors: Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters
• Keywords: Algorithms, APPROX 2011, Generic Transformation, Polynomial Time Computation, Public Key Encryption