Public Key Locally Decodable Codes with Short Keys-Reference-Cited by-同舟云学术

Public Key Locally Decodable Codes with Short Keys

Published:2011 Issue: Volume: Page:605-615
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Hemenway Brett,Ostrovsky Rafail,Strauss Martin J.,Wootters Mary

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22935-0_51

Reference18 articles.

1. Bhattacharyya, R., Chakraborty, S.: Constant query locally decodable codes against a computationally bounded adversary (2011), http://people.cs.uchicago.edu/sourav/papers/LDCbounded.pdf

2. Babi, L., Fortnow, L., Levin, L., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC 1991, pp. 21–31 (1991)

3. Lecture Notes in Computer Science;C. Cachin,1999

4. Efremenko, K.: 3-query locally decodable codes of subexponential length. In: STOC 2009, pp. 39–44. ACM, New York (2009)

5. Gopalan, P., Lipton, R.J., Ding, Y.Z.: Error correction against computationally bounded adversaries (2004) (manuscript)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relaxed Local Correctability from Local Testing;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Computationally Relaxed Locally Decodable Codes, Revisited;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

4. Relaxed Locally Correctable Codes in Computationally Bounded Channels;IEEE Transactions on Information Theory;2021-07

5. Is There an Oblivious RAM Lower Bound for Online Reads?;Journal of Cryptology;2021-05-11