A secure multi-party quantum sum negotiation method based on quantum Fourier transform

Abstract

The invention discloses a security multi-party quantum summation consultation method based on quantum Fourier transform, wherein transmitted particles are transmitted in a complete graph mode. The method disclosed by the invention can resist to an external attack and a participant attack. Particularly, a participant in a non-minimum subset cannot successfully and separately decide a shared summation calculation result. In addition, according to the method disclosed by the invention, a module d is calculated, and both calculation and summation are carried out in a mode of adding integers and integers instead of a mode of adding bits and bits.

Description

technical field [0001] The invention relates to the field of quantum cryptography. The invention designs a secure multi-party quantum summation negotiation method based on quantum Fourier transform, and realizes the secret sharing of the modulus d of the secret integer sequence of n participants and the calculation result. Background technique [0002] Secure multi-party computation, first proposed by Yao[1] and extended by Goldreic et al.[2], is an important subfield of classical cryptography. Naturally, whether the physical principles of quantum mechanics can be applied to secure multi-party computation has become an important and interesting question. So far, many researchers have carried out research on secure multi-party computation in quantum situations [3-6]. Lo[3] argues that an equality function cannot be safely weighed in the two-party case. Therefore, some additional assumptions, such as a third party (TP), should be considered. Ben-Or et al. [4] studied the f...

AI Technical Summary

Problems solved by technology

In 2016, Shi et al. [14] believed that the methods of literature [7,11] had two shortcomings: on the one hand, the modules of these two methods were too small, which limited their wider application; on the other hand, due to their Bit-to-bit calculation and communication methods, these two methods do not have high enough communication efficiency

In particular, non-minimal subset participants cannot successfully independently decide on shared summation results

Images