Author:
Chee Yeow Meng,Feng Tao,Ling San,Wang Huaxiong,Zhang Liang Feng
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference28 articles.
1. A. Ambainis (1997). Upper bound on the communication complexity of private information retrieval. In ICALP ’97: Proccedings of the 24th International Colloquium on Automata, Languages and Programming, volume 1256 of Lecture Notes in Comput. Sci., 401–407. Springer, Berlin.
2. Beimel A., Ishai Y., Kushilevitz E. (2005) General constructions for information-theoretic private information retrieval. J. Comput. System Sci. 71(2): 213–247
3. A. Beimel, Y. Ishai, E. Kushilevitz & J.-F. Raymond (2002) Breaking the $${O(n^\frac{1}{2k-1})}$$ barrier for information-theoretic private information retrieval. In FOCS ’02: Proceedings of the 43rd Symposium on Foundations of Computer Science, 261–270. IEEE Computer Society, Washington, DC, USA.
4. Chor B., Goldreich O., Kushilevitz E., Sudan M. (1998) Private information retrieval. J. ACM 45(6): 965–982
5. Curtis C.W. & I. Reiner (2006). Representation Theory of Finite Groups and Associative Algebras. AMS Chelsea Publishing, Providence, RI, xiv+689.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献