Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Journal of the ACM (JACM)
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th 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
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
A Geometric Approach to Information-Theoretic Private Information Retrieval
SIAM Journal on Computing
Locally decodable codes and private information retrieval schemes
Locally decodable codes and private information retrieval schemes
3-query locally decodable codes of subexponential length
Proceedings of the forty-first annual ACM symposium on Theory of computing
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved lower bounds for locally decodable codes and private information retrieval
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
I know what you will do next summer
ACM SIGCOMM Computer Communication Review
Enhancing deniability against query-logs
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
A novel elementary construction of matching vectors
Information Processing Letters
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SAPDS: self-healing attribute-based privacy aware data sharing in cloud
The Journal of Supercomputing
A query scrambler for search privacy on the internet
Information Retrieval
| Hi-index | 48.22 |
Cryptographic protocols safeguard the privacy of user queries to public databases.