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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ostrovsky, R., Pandey, O., & Sahai, A. (2007). Private locally decodable codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 387–398). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_35
Mendeley helps you to discover research relevant for your work.