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
Quantum symmetrically-private information retrieval
Information Processing Letters
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
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
The pynchon gate: a secure method of pseudonymous mail retrieval
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms
A tight lower bound for restricted PIR protocols
Computational Complexity
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)
Corruption and Recovery-Efficient Locally Decodable Codes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
An Efficient PIR Construction Using Trusted Hardware
ISC '08 Proceedings of the 11th international conference on Information Security
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
Multiuser private queries over encrypted databases
International Journal of Applied Cryptography
Query privacy in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
An optimal lower bound for 2-query locally decodable linear codes
Information Processing Letters
Communications of the ACM
Controlling data disclosure in computational PIR protocols
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Some applications of polynomials for the design of cryptographic protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Robust information-theoretic private information retrieval
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Private query on encrypted data in multi-user settings
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Secure coprocessor-based private information retrieval without periodical preprocessing
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Reconstruction of falsified computer logs for digital forensics investigations
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Nearest neighbor search with strong location privacy
Proceedings of the VLDB Endowment
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Short locally testable codes and proofs
Studies in complexity and cryptography
Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
SIAM Journal on Computing
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
Privately retrieve data from large databases
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
A novel elementary construction of matching vectors
Information Processing Letters
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
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
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
New bounds for matching vector families
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Coding-based quantum private database query using entanglement
Quantum Information & Computation
| Hi-index | 0.02 |
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of n bits of data. For any fixed k, the complexity of the best protocols prior to our work was 0(n^{\frac{1}{{2k - 1}}}) (Ambainis, 1997). Since then several methods were developed in an attempt to beat this bound, but all these methods yielded the same asymptotic bound.In this work, this barrier is finally broken and the complexity of information-theoretic k-server PIR is improved to n^{0(\frac{{\log \log k}}{{k\log k}})}. The new PIR protocols can also be used to construct k-query binary locally decodable codes of length exp (n^{0(\frac{{\log \log k}}{{k\log k}})}), compared to exp(n^{\frac{1}{{k - 1}}}) in previous constructions. The improvements presented in this paper apply even for small values of k: the PIR protocols are more efficient than previous ones for every k \geqslant 3, and the locally decodable codes are shorter for every k \geqslant 4.