FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
We present efficient protocols for the 1-out-of-n single-server Computationally-Private Information Retrieval (CPIR) problem for l-bit strings. In particular, our results achieve simultaneously polylogarithmic extra storage, communication, and Client and Server local computational complexities, improving the best current bounds. Most designs for CPIR exploit the communication vs. computation trade-off, whereas ours exploit instead trade-offs between accuracy and the metrics mentioned above. The work is of a theoretical nature. In a nutshell, our polylogarithmic claims show that it is possible to substantially reduce the mentioned complexity measures at the expense of accuracy of the results. The main indirect (practical) implication of this work is to show that CPIR is actually viable for very large databases. We also present some open questions and future directions.