Related papers: Quantum Private Information Retrieval for Quantum …
We introduce the problem of symmetric private information retrieval (SPIR) on replicated databases modeled by a simple graph. In this model, each vertex corresponds to a server, and a message is replicated on two servers if and only if…
Quantum private comparison (QPC) aims to accomplish the equality comparison of the secrets from different users without disclosing their genuine contents by using the principles of quantum mechanics. In this paper, we summarize eight modes…
Double blind $T$-private information retrieval (DB-TPIR) enables two users, each of whom specifies an index ($\theta_1, \theta_2$, resp.), to efficiently retrieve a message $W(\theta_1,\theta_2)$ labeled by the two indices, from a set of…
This paper considers the problem of single-server single-message private information retrieval with coded side information (PIR-CSI). In this problem, there is a server storing a database, and a user which knows a linear combination of a…
Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of…
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing…
Verifiable blind quantum computing allows a client with poor quantum devices to delegate universal quantum computing to a remote quantum server in such a way that the client's privacy is protected and the honesty of the server is verified.…
We consider a multi-user variant of the private information retrieval problem described as follows. Suppose there are $D$ users, each of which wants to privately retrieve a distinct message from a server with the help of a trusted agent. We…
To mitigate the noise in quantum channels, calibration is used to tune the devices to minimize error. Generally, calibration is performed by transmitting pre-agreed-upon calibration states and determining an error cost so the two parties…
We study the problem of pliable private information retrieval with side information (PPIR-SI) for the single server case. In PPIR, the messages are partitioned into nonoverlapping classes and stored in a number of noncolluding databases.…
Quantum secret sharing is one of the most important and interesting quantum information processing task. In quantum secret sharing, information is split among several parties such that only one of them is able to recover the qubit exactly…
In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the multi-terminal destination of the network from the user's…
Quantum private query (QPQ) is the quantum version for symmetrically private retrieval. However, the user privacy in QPQ is generally guarded in the non-realtime and cheat sensitive way. That is, the dishonest database holder's cheating to…
We consider both the classical and quantum variations of $X$-secure, $E$-eavesdropped and $T$-colluding symmetric private information retrieval (SPIR). This is the first work to study SPIR with $X$-security in classical or quantum…
A user who does not have a quantum computer but wants to perform quantum computations may delegate his computation to a quantum cloud server. In order that the delegation works, it must be assured that no evil server can obtain any…
This paper considers the problem of single-server Individually-Private Information Retrieval with side information (IPIR). In this problem, there is a remote server that stores a dataset of $K$ messages, and there is a user that initially…
The recently proposed Universal Blind Quantum Computation (UBQC) protocol allows a client to perform an arbitrary quantum computation on a remote server such that perfect privacy is guaranteed if the client is capable of producing random…
In this paper, we present a quantum-key-distribution (QKD)-based quantum private query (QPQ) protocol utilizing single-photon signal of multiple optical pulses. It maintains the advantages of the QKD-based QPQ, i.e., easy to implement and…
We present a private information retrieval (PIR) scheme that allows a user to retrieve a single message from an arbitrary number of databases by colluding with other users while hiding the desired message index. This scheme is of particular…
In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains…