Quantum symmetrically-private information retrieval

Authors:
Iordanis Kerenidis;Ronald de Wolf
Affiliations:
University of California, Computer Science Division, Berkeley, CA;CWI Amsterdam, Netherlands
Venue:
Information Processing Letters
Year:
2004

Citing 7
Cited 7

Private information retrieval

Journal of the ACM (JACM)
Protecting data privacy in private information retrieval schemes

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
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
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 Oracle Interrogation: Getting All Information for Almost Half the Price

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Development of an automatic customer service system on the internet

Electronic Commerce Research and Applications
An enhanced genetic approach to optimizing auto-reply accuracy of an e-learning system

Computers & Education
Selling multiple secrets to a single buyer

Information Sciences: an International Journal
Private predictions on hidden Markov models

Artificial Intelligence Review
Quantum private queries: security analysis

IEEE Transactions on Information Theory
Flexible protocol for quantum private query based on B92 protocol

Quantum Information Processing
Coding-based quantum private database query using entanglement

Quantum Information & Computation

Quantified Score

Hi-index	0.95

Visualization

Abstract

Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k ≥ 1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest users and dishonest servers. Classically, SPIRs without shared randomness do not exist at all.