Tripartite Blind Quantum Computation
This addresses the need for secure multi-party quantum computing, but it is incremental as it builds on existing protocols like Broadbent-Fitzsimons-Kashefi.
The paper tackles the problem of enabling secure quantum computation among three parties with distinct resources, proposing a tripartite blind quantum computation model and two protocols, with the second protocol preventing collusive attacks at the cost of requiring a classical AND-BOX call for each R-gate in the circuit.
This paper proposes a model of tripartite blind quantum computation (TBQC), in which three independent participants hold different resources and accomplish a computational task through cooperation. The three participants are called C,S,T separately, where C needs to compute on his private data, and T has the required quantum algorithm, and S provides sufficient quantum computational resources. Then two concrete TBQC protocols are constructed. The first protocol is designed based on Broadbent-Fitzsimons-Kashefi protocol, and it cannot prevent from collusive attack of two participants. Then based on universal quantum circuit, we present the second protocol which can prevent from collusive attack. In the latter protocol, for each appearance of $R$-gate in the circuit, one call to a classical AND-BOX is required for privacy.