Quantum private data sampling

摘要

We present a novel quantum communication protocol for "Private Data Sampling", where a player (Bob) obtains a random sample of limited size of a classical database, while the database owner (Alice) remains oblivious as to which bits were accessed. The protocol is efficient in the sense that the communication complexity per query scales at most linearly with the size of the database. It does not violate Lo's "no-go" theorem for one-sided two-party secure computation, since a given joint input by Alice and Bob can result in randomly different protocol outcomes. After outlining the main security features of the protocol, we present our first experimental results.