Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Communications of the ACM
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
Information-Theoretic Private Information Retrieval: A Unified Construction
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Compressing Cryptographic Resources
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Better Lower Bounds for Locally Decodable Codes
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Communication Complexity of Simultaneous Messages
SIAM Journal on Computing
A Geometric Approach to Information-Theoretic Private Information Retrieval
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
IEEE Transactions on Information Theory
Towards 3-query locally decodable codes of subexponential length
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The complexity of online memory checking
Journal of the ACM (JACM)
Selling multiple secrets to a single buyer
Information Sciences: an International Journal
3-query locally decodable codes of subexponential length
Proceedings of the forty-first annual ACM symposium on Theory of computing
Communications of the ACM
SIAM Journal on Computing
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
A historical probability based noise generation strategy for privacy protection in cloud computing
Journal of Computer and System Sciences
A trust-based noise injection strategy for privacy protection in cloud
Software—Practice & Experience
A Time-Series Pattern Based Noise Generation Strategy for Privacy Protection in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.02 |
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved; specifically, in a t-private k-server PIR protocol the database is replicated among k servers, and the user's privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data. This work addresses the information-theoretic setting for PIR, where the user's privacy should be unconditionally protected against computationally unbounded servers. We present a general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Gal, Kimmel, and Lokam for a communication complexity problem in the multiparty simultaneous messages model. Our protocols simplify and improve upon previous ones, and resolve some previous anomalies. In particular, we get (1) 1-private k-server PIR protocols with O(k^3n^1^/^(^2^k^-^1^)) communication bits, where n is the database size; (2) t-private k-server protocols with O(n^1^/^@?^(^2^k^-^1^)^/^t^@?) communication bits, for any constant integers kt=1; and (3) t-private k-server protocols in which the user sends O(logn) bits to each server and receives O(n^t^/^k^+^@e) bits in return, for any constant integers kt=1 and constant @e0. The latter protocols have applications to the construction of efficient families of locally decodable codes over large alphabets and to PIR protocols with reduced work by the servers.