Yuval Ishai
- 1.M. Abadi, J. Feigenbaum, and J. Kili~. On hiding information from an oracle (extended abstract). In Proc. of 19th STOC, pages 195-203, 1987. Journal version ill JCSS vol 39 pp. 21-50, 1980.]] Google Scholar
Digital Library
- 2.A. Ambainis. Upper bound on the communication complexity of private information retrieval. In Proc. of ~4th ICALP, volume 1256 of Lecture Notes in Computer Science, pages 401-407, 1997.]] Google ScholarDigital Library
- 3.D. Beaver and J. Feigenbaum. Hiding instances in multior~cle queries. In C. Choffrut and T. Lengauer, editors, STAOS '90, 7th Annu. Syrup. on Theoretical Aspects of Computer Science, volume 415 of/~cture Notes in Computer Science, pages 37-48. Springer- Verlag, 1990.]] Google ScholarDigital Library
- 4.D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: Improvements and applications. $. of Cr~fptology, 10(1):17-36, 1997. Early version' Security with small communication overhead, CRYPTO '90, LNCS 537, pages 62-76.]] Google ScholarDigital Library
- 5.D. Beaver and A. Wool Quorum-based secure multiparty computation. In Proc. of EUROCRYPT'98, LNCS 1403, Springer Verlag, pages 375-390, 1998.]]Google Scholar
- 6.A. Beimel, Y. Ish~i, E. Kushilevitz, and T. Malkin. One-way functions are essential for single-server private information retrieval. In Proc. of the 31~h Annu. A CM SFrnp. on the Theor~ of Computing, 1999.]] Google ScholarDigital Library
- 7.C. Cachin, S.Micali, and M. StaAler. Computationslly private information retrieval with polylogarithrnic communication. In Advancez in CrFptolog~l - E UROCR YPT '99, 1999.]]Google Scholar
- 8.B. Chor and N. (}ilboa. Computationally private informarion retriewl. In Proc. of ~9th $TOC, pages 304- 313, 1997.]] Google ScholarDigital Library
- 9.B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. of S6th FOES, pages 41-50, 1995. To appeaz in JACM.]] Google ScholarDigital Library
- 10.R. Cramer, I. Damgard, and U. Maurer. Span programs and secure general multiparty computation. BKICS Report Series, B.S-97-28, 1997. Available from http://www.bdcs.dk.]]Google Scholar
- 11.G. Di Crescenzo, Y. Ishd, and R. Ostrovsky. Universal service-providers for database private information retrieval. In Pro~. of the 17th Annu. A CM Syrup. o~ Principles of Distributed Computing, pages 91-100, 1998.]] Google ScholarDigital Library
- 12.Y. Gertner, S. Goldwazser, and T. Malkin. A random server model for private information retrieval (or how to achieve information theoretic PIR avoiding data replication). In Proc. of l~nd RANDOM, 1998.]] Google ScholarDigital Library
- 13.Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proc. of the 30th A nnu. A CM Syrup. on the Theory of Computing, pages 151-160, 1998.]] Google ScholarDigital Library
- 14.M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In Proc. IEEE Global Telecommunication Conf., Globecorn 87, pages 99-102, 1987.]]Google Scholar
- 15.E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private infoimation retrieval. In Proc. of the $8th A nnu. IEEE $yrnp. on Foundations of Computer Science, pages 364- 373, 1997.]] Google ScholarDigital Library
- 16.E. Mann. Private access to distributed in~ormation. Master's thesis, Technion- Israel Institute of Technology, Haifa, 1998.]]Google Scholar
- 17.R. Ostrovsky and V. Shoup. Private information storage. in Proc. of ~gth $TOC, pages 294-303, 1997.]] Google ScholarDigital Library
- 18.A. Shamir. How to share a secret. Cornrnun. A CM, 22(6):612-613, June 1979.]] Google ScholarDigital Library
Index Terms
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
Recommendations
Information-theoretic upper and lower bounds for statistical estimation
In this paper, we establish upper and lower bounds for some statistical estimation problems through concise information-theoretic arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential ...
Improved upper bounds on sizes of codes
Let A(n,d) denote the maximum possible number of codewords in a binary code of length n and minimum Hamming distance d. For large values of n, the best known upper bound, for fixed d, is the Johnson bound. We give a new upper bound which is at least as ...
Approximate information retrieval based on multielement bounds
Ontology-based information systems can offer precision and effective information retrieval but suffer from the problem of ontology heterogeneity. Approximate information filtering approaches use approximations of concepts to solve this problem. Current ...
Comments