How to construct random functions
Journal of the ACM (JACM)
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Journal of the ACM (JACM)
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Information-Theoretic Private Information Retrieval: A Unified Construction
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A New Approach To Information Theory
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Better Lower Bounds for Locally Decodable Codes
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Private Codes or Succinct Random Codes That Are (Almost) Perfect
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Towards 3-query locally decodable codes of subexponential length
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Optimal error correction against computationally bounded noise
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Class of constructive asymptotically good algebraic codes
IEEE Transactions on Information Theory
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Public-Key Locally-Decodable Codes
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Public key locally decodable codes with short keys
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
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