Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR11-118 | 6th September 2011 03:00

Public Key Locally Decodable Codes with Short Keys

TR11-118
Authors: Brett Hemenway, Rafail Ostrovsky, Martin Strauss, Mary Wootters
Publication: 10th September 2011 23:19
Keywords:

Abstract:

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 $\bigoh(\lambda)$, and negligible probability of decoding failure, for security parameter $\lambda$.
Hemenway and Ostrovsky gave a construction of locally decodable codes in the public-key model with constant codeword expansion and locality $\bigoh(\lambda^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 $\Phi$-hiding assumption.
Our keys are of length proportional to the security parameter instead of the message, and our construction relies only on the existence of IND-CPA secure encryption rather than on specific number-theoretic assumptions. Our scheme also decreases the locality
from $\bigoh(\lambda^2)$ to $\bigoh(\lambda)$.
Our construction can be modified to give a generic transformation of any private-key locally decodable code to a public-key locally decodable code based only on the existence of an IND-CPA
secure public-key encryption scheme.

ISSN 1433-8092 | Imprint