Secure multi-party computing method based on verifiable blind quantum computing

Abstract

The invention belongs to the field of quantum cryptography, and particularly relates to a secure multi-party computing method based on verifiable blind quantum computation. The secure multi-party computing method comprises the three stages that the first stage is a preparation stage, and in the preparation stage, an S (T) graph is systematically generated and generated quantum bits are subjected to data encryption processing; the second stage is a calculation stage, and the final output quantum state is calculated according to the actually measured angle by calculating the actually measured angle; and the third stage is an output stage, in the output stage, trap quantum bits are checked through Alice to determine a correct calculation result, and the result is output. According to the method, the number of participated clients is expanded from two clients to multiple clients, the requirement of multi-party calculation can be met, and the method has higher expansibility and practicability.

Description

technical field [0001] The invention belongs to the field of quantum cryptography, and in particular relates to a secure multi-party computing method based on verifiable blind quantum computing. Background technique [0002] The classic safe two-party problem, namely the millionaire problem, mainly studies the problem of knowing which of the two millionaires is richer without disclosing their specific wealth values ​​in the early stage. Based on this problem model, more and more secure multi-party computation protocols have been proposed. As an important part of cryptography, classical secure multi-party computing refers to multiple users who do not trust each other to complete computing tasks together and ensure their privacy is not disclosed. [0003] With the continuous improvement of customers' demand for computer computing power, the demand for entrusted computing in the form of cloud computing is increasing day by day. Quantum computing, as an emerging computing mode...

AI Technical Summary

Problems solved by technology

[0006] In order to solve the problems of large resource consumption, high requirements for customers' quantum capabilities and low security in the current secure two-party computing based on verifiable blind quantum computing, the present invention proposes a secure multi-party computing based on verifiable blind quantum computing The method includes three stages: system initialization, quantum state calculation and result output;

Images