Elements of information theory
Elements of information theory
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
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Quantum symmetrically-private information retrieval
Information Processing Letters
ACM SIGACT News - A special issue on cryptography
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
Quantum Information Processing
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Flexible protocol for quantum private query based on B92 protocol
Quantum Information Processing
Coding-based quantum private database query using entanglement
Quantum Information & Computation
Hi-index | 754.84 |
A security analysis of the recently introduced Quantum Private Query (QPQ) protocol is presented. The latter is a cheat sensitive quantum protocol to perform a private search on a classical database. It allows a user to retrieve an item from the database without revealing which item was retrieved, and at the same time it ensures data privacy of the database (the information that the user retrieves in a query is bounded). The security analysis is based on information-disturbance tradeoffs which show that whenever the provider tries to obtain information on the query, the query (encoded into a quantum system) is disturbed so that the person querying the database can detect the privacy violation. The security bounds are derived under the assumption that a unique answer corresponds to each query. To remove this assumption, some simple variants of the protocol are illustrated, and it is conjectured that analogous security bounds apply to them.