Tripartite Blind Quantum Computation

TL;DR

This paper introduces a tripartite model for blind quantum computation involving three independent parties, proposing two protocols with the second ensuring security against collusive attacks using classical AND-BOX calls.

Contribution

It presents a novel tripartite model for blind quantum computation and develops two protocols, with the second enhancing security against collusion using universal quantum circuits.

Findings

First protocol based on Broadbent-Fitzsimons-Kashefi protocol, vulnerable to collusion.

Second protocol using universal quantum circuit prevents collusive attacks.

Implementation of classical AND-BOX for privacy in the second protocol.

Abstract

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.