Private Locally Decodable Codes
暂无分享,去创建一个
[1] Silvio Micali,et al. Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.
[2] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[3] Kenji Obata,et al. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.
[4] Richard J. Lipton,et al. A New Approach To Information Theory , 1994, STACS.
[5] Adam D. Smith. Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes , 2007, SODA '07.
[6] Satyanarayana V. Lokam,et al. An optimal lower bound for 2-query locally decodable linear codes , 2006, Inf. Process. Lett..
[7] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[8] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[9] Yuval Ishai,et al. Information-Theoretic Private Information Retrieval: A Unified Construction , 2001, ICALP.
[10] Michael Langberg,et al. Private codes or succinct random codes that are (almost) perfect , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[11] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[12] Madhu Sudan,et al. Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems , 1995, Lecture Notes in Computer Science.
[13] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[14] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[15] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[16] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] Ronald de Wolf,et al. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval , 2004, ICALP.
[18] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[19] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[20] Jaikumar Radhakrishnan,et al. Better lower bounds for locally decodable codes , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[21] Yuval Ishai,et al. Breaking the Barrier for Information-Theoretic Private Information Retrieval , 2002 .
[22] David P. Woodruff. New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..
[23] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[24] Yuval Ishai,et al. Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[25] Luca Trevisan,et al. Lower bounds for linear locally decodable codes and private information retrieval , 2006, computational complexity.
[26] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.