|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
38th Annual Symposium on Foundations of Computer Science (FOCS '97)
Replication is not needed: single database, computationally-private information retrieval
Miami Beach, FL
October 19-October 22
ISBN: 0-8186-8197-7
| ASCII Text | x | ||
| E. Kushilevitz, R. Ostrovsky, "Replication is not needed: single database, computationally-private information retrieval," Foundations of Computer Science, IEEE Annual Symposium on, pp. 364, 38th Annual Symposium on Foundations of Computer Science (FOCS '97), 1997. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1997.646125, author = {E. Kushilevitz and R. Ostrovsky}, title = {Replication is not needed: single database, computationally-private information retrieval}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1997}, issn = {0272-5428}, pages = {364}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646125}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Replication is not needed: single database, computationally-private information retrieval SN - 0272-5428 SP EP A1 - E. Kushilevitz, A1 - R. Ostrovsky, PY - 1997 KW - information retrieval; computationally private information retrieval; data replication; computational private information retrieval problem; quadratic residuosity assumption; communication complexity VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
We establish the following, quite unexpected, result: replication of data for the computational private information retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationally private information retrieval scheme with O(n/sup /spl epsiv//) communication complexity for any /spl epsiv/>0.
Index Terms:
information retrieval; computationally private information retrieval; data replication; computational private information retrieval problem; quadratic residuosity assumption; communication complexity
Citation:
E. Kushilevitz, R. Ostrovsky, "Replication is not needed: single database, computationally-private information retrieval," focs, pp.364, 38th Annual Symposium on Foundations of Computer Science (FOCS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.