A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking the O(n 1/(2k-1) ) Barrier for InformationTheoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261--270, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2003) (11 citations) (Correct)
....main complexity question about LDCs is how large m needs to be, as a function of n, q, and . For q = polylog(n) Babai et al. 2] showed how to achieve length m = O(n ) for some xed ; This was subsequently improved to nearly linear length by Polishchuk and Spielman [23] Beimel et al. [6] recently improved the best known upper bounds for constant q to , with some more precise bounds for small q. The study of lower bounds on m was initiated by Katz and Trevisan [16] They proved that for q = 1, LDCs do not exist if n is larger than some constant depending on and . For q 2, ....
....and is optimal. If the database is replicated over k 2 servers, then smarter protocols are possible. Chor et al. 8] exhibited a 2 server PIR scheme with communication complexity O(n ) and one with O(n 1=k ) for k 2. Ambainis [1] improved the latter to O(n ) Beimel et al. [6] improved the communication complexity to 2 log log k=k log k ) their results improve the previous best bounds for all k 3 but not for k = 2. No general lower bounds better than an n) are known for PIRs with k 2 servers. A PIR scheme is linear if for every query the user makes, the ....
[Article contains additional citation context not shown here]
A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond. Breaking the O(n ) barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, pages 261-270, 2002.
A Nearly Tight Lower Bound for Private Information.. - Beigel, Fortnow, Gasarch (2003) (2 citations) (Correct)
....each other then the number of bits can be reduced. We refer to a copy of the database as a server. Many upper bounds have been obtained. These include 1. If there are two servers then O(n ) bits of communication suce [4] 2. If there are k servers then O(n ) bits of communication suce [1, 2]. 3. If there are k servers then n O(log log k=k log k) bits of communication suce [2] Lower bounds on Private Information Retrieval Systems have been hard to obtain. Lower bounds are only known for 2 server protocols with one round and restrictions on the number of bits returned by the ....
....a server. Many upper bounds have been obtained. These include 1. If there are two servers then O(n ) bits of communication suce [4] 2. If there are k servers then O(n ) bits of communication suce [1, 2] 3. If there are k servers then n O(log log k=k log k) bits of communication suce [2]. Lower bounds on Private Information Retrieval Systems have been hard to obtain. Lower bounds are only known for 2 server protocols with one round and restrictions on the number of bits returned by the servers. Even then, prior to Kerenidis and de Wolf [7] all lower bounds had restrictions on ....
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Rayomnd. Breaking the o(n ) barrier for information-theoretic private information retrieval. In Proc. of the 43st IEEE Sym. on Found. of Comp. Sci., 2002.
Cryptography from Anonymity - Yuval Ishai Eyal Self-citation (Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking the O(n 1/(2k-1) ) Barrier for InformationTheoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261--270, 2002.
Cryptography from Anonymity - Ishai, Kushilevitz, Ostrovsky, Sahai (2006) Self-citation (Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking the O(n 1=(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261--270, 2002.
On the Hardness of Information-Theoretic Multiparty Computation - Ishai, Kushilevitz (2004) Self-citation (Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond. Breaking the O(n 1=(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval. In Proc. of 43rd FOCS, pages 261-270, 2002.
Batch Codes and Their Applications - Yuval Ishai Yuvali (2004) Self-citation (Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond. Breaking the O(n 1=(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261-270, 2002.
General Constructions for Information-Theoretic Private .. - Beimel, Ishai.. (2003) (3 citations) Self-citation (Beimel Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. F. Raymond. Breaking the O(n ) barrier for informationtheoretic private information retrieval. In Proc. of the 43rd Annu. IEEE Symp. on Foundations of Computer Science, pages 261--270, 2002.
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) Self-citation (Ishai Kushilevitz) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Raymond. Breaking the O(n 1/(2k-1) ) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261-270, 2002.
Private Information Retrieval Using Trusted Hardware - Wang, Ding, Deng, Bao (2006) (Correct)
No context found.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Jean-Franois Raymond. Breaking o(n 1/(2k-1) ) barrier for information-theoretic private information retrieval. In FOCS, pages 261270. IEEE Computer Society, 2002.
Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2002) (11 citations) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond. Breaking the O(n ) barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, 2002. To appear.
Improved Lower Bounds for Locally Decodable Codes and Private .. - Wehner, de Wolf (2004) (2 citations) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond. Breaking the O(n 1=(2k 1) ) barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, pages 261-270, 2002.
The Pynchon Gate: A Secure Method of Pseudonymous Mail Retrieval - Sassaman, Cohen (Correct)
No context found.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Jean-Francois Raymond. Breaking the O(n 1/(2k-1) ) Barrier for Information-Theoretic Private Information Retrieval. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), 2002.
Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
No context found.
Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Jean-Franois Raymond. Breaking the O(n 1/(2k-1) ) barrier for information-theoretic private information retrieval. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 261--270, 2002.
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) (Correct)
No context found.
Beimel, A., Ishai, Y., Kushilevitz, E., and Raymond, J. F. Breaking the O(n 1=(2k 1) barrier for information-theoretic private information retrieval. In Proc. 43rd IEEE Symp. on Foundations of Comp. Science (Vancouver, British Columbia, Canada, 16-19 Nov. 2002), pp. 261-270.
The Computational Complexity Column - Lance Fortnow Department (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Rayomnd. Breaking the o(n ) barrier for information-theoretic private information retrieval. In Proc. of the 43st IEEE Sym. on Found. of Comp. Sci., 2002.
Robust PCPs of Proximity, Shorter PCPs and.. - Ben-Sasson.. (2004) (Correct)
No context found.
Beimel, A., Ishai, Y., Kushilevitz, E., and Raymond, J. F. Breaking the O(n 1=(2k 1) barrier for information-theoretic private information retrieval. In Proc. 43rd IEEE Symp. on Foundations of Comp. Science (Vancouver, British Columbia, Canada, 16-19 Nov. 2002), pp. 261-270.
Quantum Computation and Privacy - Wehner (2004) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond. Breaking the O(n barrier for information-theoretic Private Information Retrieval. In Proceedings of 43rd IEEE FOCS, pages 261--270, 2002.
A Survey on Private Information Retrieval - Gasarch (2004) (1 citation) (Correct)
No context found.
A. Beimel, Y. Ishai, E. Kushilevitz, and J.-F. Rayomnd. Breaking the o(n ) barrier for information-theoretic private information retrieval. In Proc. of the 43st IEEE Sym. on Found. of Comp. Sci., 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC