A Nearly Tight Bound for Private Information Retrieval Protocols
暂无分享,去创建一个
[1] Ronald de Wolf,et al. Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.
[2] Lance Fortnow,et al. On the Power of Two-Local Random Reductions , 1992, Inf. Process. Lett..
[3] 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..
[4] Andris Ambainis,et al. On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .
[5] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[6] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.