The Design And Analysis Of Measurement-based Multi-party Blind Quantum Computation Protocols

As Moore’s Law gradually approaches the upper limit,classical computation faces problems such as limited computing speed and insufficient computing power.Based on the quantum mechanics,quantum computation has excellent performance in terms of parallel computing speed and information security,and it is expected to bring subversive changes to the new era of information technology.In order to explore a safe application mode of quantum computation,blind quantum computation came into being.In blind quantum computation,the classical client can entrust a remote quantum server to complete complex computing tasks,which provides a reliable technical guarantee for the confidentiality of data and algorithms.As an important part of blind quantum computation,the measurement-based blind quantum computation model can effectively reduce the quantum capabilities required by the classical clients.Considering the large-scale application of blind quantum computation in the future,exploring efficient and flexible multi-party blind quantum computing protocols has significant research significance.However,there are two key problems in the current blind quantum computation protocols:one is that ignoring identity authentication leads to illegal use of computing resources;the other is that ignoring honesty verification makes the client deceived by wrong output.These two key issues will eventually affect key elements of information security such as the legitimacy of entities,the reliability of output,and the security of the overall protocol,and will seriously hinder the large-scale application of blind quantum computation.Based on the measurement-based blind quantum computation model,this paper proposes a multi-party blind quantum computation protocol with mutual identity authentication and a verifiable multi-party blind quantum computation protocol.Through comparative analysis,it is found that the proposed protocols have significant advantages in ensuring the security of blind quantum computation and improving the practicability and feasibility of the protocol.The main work of the thesis is as follows:(1)A multi-party blind quantum computation protocol with mutual identity authentication is proposed.In order to avoid the problem of malicious entities illegally obtaining computing resources by disguising their legal identities,this protocol uses the identity key information pre-shared by the clients and servers to achieve safe and effective two-way identity authentication in multi-party blind quantum computation.Firstly,with the help of the non-orthogonal state indistinguishability theorem and the idea of the MDI-QKD protocol,the proposed protocol introduces quantum key distribution and quantum identity authentication into the field of measurement-based blind quantum computation for the first time.In addition,the protocol innovatively builds a fair and efficient multi-party network architecture.Through the dynamic control of load balancers,it guarantees the fairness when processing multi-clients’computing tasks and maximizes the work efficiency of the multi-party network.Finally,compared with other blind quantum computation protocols,the semi-trusted third-party CA in this protocol does not directly determine the legitimacy of the client and server,but is only responsible for preparing non-orthogonal state sequences for authentication.The third party is less dependent and has more practical value in the real environment.With the help of a semi-trusted third party,the classical client only needs to perform single-qubit measurements to achieve reliable identity authentication and secure blind quantum computation,which greatly improves the usability and practicability of the protocol.(2)A verifiable multi-party blind quantum computation protocol is given.In order to handle with the problem that the client may be deceived by the wrong computing resource state prepared by a dishonest server,this protocol uses the stabilizer form of the computing resource state to propose an honesty verification method.First of all,the protocol provides a reliable honesty verification method,so that the classical clients only need to perform Pauli measurements to determine whether the remote quantum server has correctly executed the instructions.In addition,the protocol constructs an efficient and fault-tolerant distributed multi-party network,which can accommodate up to n subnets at the same time for honesty verification and blind quantum computing.Even if a certain subnet fails,the load balancing center will flexibly adjust unprocessed computing tasks to other available subnets.In addition,the trusted third party in the agreement is optional.Based on the no-signal principle,the correctness and security of the protocol can still be guaranteed without the intervention of an arbitrator.Compared with the existing verifiable blind quantum computation protocol,this protocol achieves honesty verification without improving the quantum capabilities required by the clients,and effectively improves the feasibility of the protocol by building an efficient and fault-tolerant distributed multi-party network environment.