A quantum-safe multi-party summation method based on quantum circuits
By employing a quantum-safe multi-party summation method based on quantum circuits, and utilizing quantum state secret share negotiation and addition circuit computation, the problems of reliance on trusted third parties and insufficient security in existing technologies are solved. This achieves unconditionally secure multi-party computation and information protection, and improves computational efficiency and scalability.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- ZHEJIANG ZHIJIANG SHUAN QUANTUM TECH CO LTD
- Filing Date
- 2026-03-26
- Publication Date
- 2026-06-30
AI Technical Summary
Existing quantum-safe multi-party summation methods suffer from reliance on trusted third parties, excessively large key and ciphertext sizes, limited computational circuit depth, insufficient fault tolerance, and a lack of verification mechanisms for malicious server behavior. Furthermore, their security depends on classical cryptographic assumptions, making it difficult to achieve unconditionally secure multi-party computation.
A quantum circuit-based approach is adopted to achieve secure summation of multiple parties without the need for third-party intervention by negotiating the secret share of quantum states in the offline stage and performing quantum addition circuit calculations in the online stage. Quantum state addition is performed using quantum NOT gates, Hadamard gates, and controlled phase gates, and information transmission is achieved by combining quantum Fourier transform and QKD network.
It enables multiple participants to jointly calculate integer sums without revealing any information other than the result, preventing collusion and eavesdropping. It has good scalability and support for quantum state inputs, improving security and efficiency.
Smart Images
Figure CN121923819B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the field of quantum-safe multi-party computation technology, and in particular to a quantum-safe multi-party summation method based on quantum circuits. Background Technology
[0002] Quantum-safe multi-party summation methods aim to allow multiple, untrusted parties to collaboratively compute the sum of multiple quantum states without revealing their private data, balancing functionality and security. In classical cryptography, secure multi-party computation typically relies on difficult problems such as large number factorization and the discrete logarithm problem to ensure security. However, with the development of quantum computing technology, especially the introduction of Shor's quantum algorithm, these cornerstones of classical cryptography face the potential threat of being compromised.
[0003] Currently, research on quantum-safe multi-party summation methods mainly focuses on the following directions. The first is methods based on quantum entanglement distribution. These methods typically rely on a trusted third party, which constitutes a security bottleneck in practical deployments. The second is methods based on single-particle sequences and decoy states. Their security heavily depends on the statistical detection of eavesdropping behavior, and there is a risk of information leakage in scenarios with finite-length keys. The third is a computational framework based on quantum homomorphic encryption. Fully homomorphic quantum encryption schemes are still mainly in the theoretical exploration stage and are far from practical application. Existing schemes generally suffer from problems such as excessively large key and ciphertext sizes, limited computational circuit depth, and extremely high fault tolerance requirements. Furthermore, the entire computation process depends entirely on the correct execution of the server, lacking an effective verification mechanism for malicious server behavior. The fourth is schemes based on classical cryptography and post-quantum cryptography. The security of these schemes is based on the assumption of computational complexity of new mathematical problems, and is not information-theoretic secure or unconditionally secure. Summary of the Invention
[0004] To address the aforementioned shortcomings of existing technologies, this invention proposes a quantum-safe multi-party summation method based on quantum circuits, which achieves quantum-safe summation without the need for third-party intervention. The technical effect is that each participant can jointly calculate the sum of integers without obtaining any information other than the result.
[0005] The technical solution of this invention is implemented as follows:
[0006] A quantum-safe multi-party summation method based on quantum circuits, the method comprising:
[0007] Offline phase:
[0008] S1: All participating parties jointly negotiate to obtain a quantum state secret share, which is an auxiliary value required for the online part to be calculated.
[0009] Online phase:
[0010] S2: Participants input real data and execute a quantum addition circuit with the secret share;
[0011] S3: Participants sequentially send the results of executing the quantum addition circuit to the next participant for calculation;
[0012] S4: Step S3 continues the calculation until the penultimate participant. The last participant measures the final result and discloses the result to all participants.
[0013] Preferably, the specific steps of step S1 in the offline phase are as follows:
[0014] 1) Each participant Randomly generated random values And convert the random value into a value of length . binary sequence;
[0015] 2) Each participant For each random value ,initialization Each quantum bit is state, traversing the above For each bit, at the position where the bit value is 1, the corresponding qubit is flipped using a quantum NOT gate, resulting in the final quantum state. , recorded as ;
[0016] 3) Each participating party , to quantum state Send to the corresponding participants via a secure channel Retain a quantum state for yourself ;
[0017] 4) Each participant A random quantum state is obtained by adding the quantum states received from other participants to the quantum state it retains. Recorded as auxiliary value .
[0018] Preferably, the online phase is achieved using auxiliary values. The online phase involves summing the actual input values of the participants, and the specific steps of steps S2, S3, and S4 are as follows:
[0019] 1) Each participant Input a string of length quantum state , denoted as and will and auxiliary values The addition circuit is executed to obtain , recorded as ;
[0020] 2) Participating parties via secure channel Send to participants via key encryption ;
[0021] 3) For participating parties Perform the following steps in sequence:
[0022] a) Participating parties Users and Participants Same key decryption participants The message was sent, and the decrypted quantum state was compared with its own quantum state. Added using a quantum addition circuit;
[0023] b) Participating parties The result obtained by addition via quantum addition circuitry is sent to the participants through a secure channel. Participants Do not perform this step;
[0024] 4) Participating parties A quantum state result obtained by summing all values was obtained, and the result was sent to all participants.
[0025] Preferably, during the offline phase, each participant Randomly generated random values satisfy .
[0026] Preferably, the quantum adder circuit has unitarity and is capable of performing parallel computations on superposition states.
[0027] Compared with the prior art, the present invention has the following beneficial effects:
[0028] This invention proposes a quantum-safe multi-party summation method based on quantum circuits. This method enables multi-party summation without the involvement of a trusted third party, and does not leak any information other than the result. By having each participant negotiate a quantum secret share in the offline phase, and then using this secret share to hide the true input in the online phase, it can prevent... This method allows participating parties to collude to infer the true input of other participating parties, while also preventing eavesdropping by third parties; it prevents third-party monitoring through secure channels and prevents the leakage of private data; it has good scalability, enabling multiple participating parties to jointly sum and supports quantum state input. Attached Figure Description
[0029] Figure 1 This is the overall flowchart of the quantum-safe multi-party summation method based on quantum circuits of the present invention;
[0030] Figure 2 This is a circuit diagram of the quantum Fourier transform in an embodiment of the present invention. Detailed Implementation
[0031] The present invention will now be clearly and completely described with reference to the accompanying drawings in the embodiments of the present invention.
[0032] like Figure 1 As shown, a quantum-safe multi-party summation method based on quantum circuits is described, the method comprising:
[0033] Offline phase:
[0034] S1: All participating parties jointly negotiate to obtain a quantum state secret share, which is an auxiliary value required for the online part to be calculated.
[0035] Online phase:
[0036] S2: Participants input real data and execute a quantum addition circuit with the secret share;
[0037] S3: Participants sequentially send the results of executing the quantum addition circuit to the next participant for calculation;
[0038] S4: Step S3 continues the calculation until the last participant, who measures the final result and discloses the result to all participants.
[0039] The method requires no third-party involvement. Each participant can jointly calculate the sum of integers without obtaining any information other than the result. The method is divided into two parts: an offline stage and an online stage. The offline stage calculates the auxiliary calculation values required for the online stage. The offline stage generates the auxiliary calculation values according to the following steps, which can improve the speed of the online stage. Specifically, it includes the following steps:
[0040] 1) Each participant First, it needs to be randomly generated. random values And needs to meet And convert the random value to a length of A binary sequence.
[0041] 2) Each participant For each random value ,initialization Each quantum bit is state, traversing the above Given a classical bit sequence, for each position in the sequence with a value of 1, the corresponding qubit is flipped using a quantum NOT gate (X gate). The resulting quantum state is... , recorded as .
[0042] 3) Each participating party , to quantum state Send to the corresponding participants via a secure channel Retain a quantum state for yourself .
[0043] 4) Each participant A random quantum state is obtained by adding the quantum states received from other participants to the quantum state it retains. Recorded as .
[0044] The online phase uses the auxiliary values generated in the offline phase to sum the actual input values of the participants. The online phase performs safe summation calculations according to the following steps.
[0045] 1) Each participant Input a string of length quantum state , denoted as and will and auxiliary values The addition circuit is executed to obtain , recorded as .
[0046] 2) Participating parties via secure channel Send to participants via key encryption .
[0047] 3) For participating parties Follow these steps in sequence.
[0048] a) Participating parties Users and Participants Same key decryption participants The message was sent, and the decrypted quantum state was compared with its own quantum state. Added using a quantum adder circuit.
[0049] b) Participating parties Users and Participants The result obtained by adding via quantum addition circuit through a secure channel is encrypted with a key and sent to the participants. (Participants) Do not perform this step).
[0050] 4) The participants obtained a quantum state result from the sum of all values and sent the result to all participants.
[0051] Embodiments of the present invention:
[0052] This embodiment provides a specific implementation of a quantum-safe multi-party summation method based on quantum circuits. The technologies involved are quantum Fourier transform and QKD network, which requires quantum NOT gate (X gate) flipping, Hadamard gate, and controlled phase gate in the quantum circuit, as follows.
[0053] 1) Each participant First, it needs to be randomly generated. A random value, and it needs to satisfy Then, the random value is converted into a binary sequence of length . The specific steps are as follows:
[0054] a) Length is The range of digit integers is: First, generate an independent A random integer, each number randomly selected with a sign (positive or negative), and its absolute value is... Uniformly and randomly selected from within, denoted as .
[0055] b) Before calculation The sum of the numbers Calculate the first Integer The range of values is .
[0056] c) Calculation and will Convert to a binary sequence.
[0057] 2) Each participant For each random value ,initialization Each quantum bit is state, traversing the above Given a classical bit sequence, for each position in the sequence with a value of 1, perform a quantum NOT gate (X-gate) flip on the corresponding qubit. The resulting quantum state is... , recorded as .
[0058] 3) Each participating party , to quantum state It is sent to the corresponding participants via the QKD quantum communication channel. Retain a quantum state for yourself .
[0059] 4) Each participant A random quantum state is obtained by adding the quantum states received from other participants to the quantum state it retains. Recorded as .
[0060] The online phase uses the auxiliary values generated in the offline phase to sum the actual input values of the participants. The online phase performs safe summation calculations according to the following steps.
[0061] 1) Each participant Input a string of length quantum state , denoted as and will and auxiliary values The addition circuit is executed to obtain , recorded as .
[0062] 2) Participating parties With participating parties A common key is obtained through QKD key distribution, and the participating parties Will Send to participants via key encryption .
[0063] 3) For participating parties Perform the following steps in sequence:
[0064] Participants Users and Participants Same key decryption participants The message was sent, and the decrypted quantum state was compared with its own quantum state. The addition is performed using a quantum adder circuit. The steps of the quantum adder circuit are as follows:
[0065] a) Represent your own quantum superposition state as the quantum state of the first addend. From the participating parties The quantum superposition state of the received calculation result is denoted as the quantum state of the second addend. The tensor product of two qubits is
[0066] .
[0067] b) Apply a quantum Fourier transform to the quantum state of the second addend, where the quantum Fourier transform circuit diagram is as follows: Figure 2 As shown in the figure, H represents the Hadamard gate, and R represents the phase shift gate. For one qubit. First, consider the second addend. All qubits Apply complete The quantum Fourier transform of a quantum bit is an operation of...
[0068] .
[0069] This transformation will Each ground state component From its "numerical representation" to its "phase representation". The entire superposition state The information is converted to a Fourier basis and encoded in the relative phase of the qubit.
[0070] c) Perform controlled phase rotation, first from the least significant bit to the most significant bit (index). arrive ), process quantum states sequentially The Each qubit. Secondly, for each... Using it as a control bit for quantum states Multiple target bits execute a series of controlled phase rotation gates. For quantum states The qubits ( arrive Apply a controlled phase rotation gate, the rotation angle of which is... .because It is a superposition state, and the above control operation is "coherently controlled". The circuit will simultaneously control all... The component performs its corresponding phase rotation operation, and the resulting state is:
[0071] ,
[0072] The operation involves applying a phase shift to the second bit, with the first bit as the controlled bit:
[0073] .
[0074] d) Applying an inverse quantum Fourier transform to the quantum state Apply The inverse quantum Fourier transform of a qubit is represented as follows:
[0075] .
[0076] The inverse QFT transforms the information in the phase space (i.e., the phase distribution after addition) into a spatial representation of the computational basis. At this point, the quantum state... The state evolution is as follows
[0077] .
[0078] b) Participating parties Users and Participants A common key is obtained through QKD key distribution, and the participating parties The result obtained by addition using a quantum addition circuit is encrypted with a key and sent to the participants. (Participants) Do not perform this step).
[0079] 4) Participating parties A quantum state result obtained by summing all values was obtained, and the result was sent to all participants.
[0080] As can be seen from the embodiments of the present invention, the present invention proposes a quantum-safe multi-party summation method based on quantum circuits, which can achieve multi-party joint summation without the participation of a trusted third party and without leaking any information other than the result; by having each participant jointly negotiate a quantum secret share in the offline stage, and using the secret share to hide the real input in the online stage, it can prevent...
[0081] This method allows participating parties to collude to infer the true input of other participating parties, while also preventing eavesdropping by third parties; it prevents third-party monitoring through secure channels and prevents the leakage of private data; it has good scalability, enabling multiple participating parties to jointly sum and supports quantum state input.
Claims
1. A quantum-safe multi-party summation method based on quantum circuits, characterized in that, The method includes: Offline phase: S1: All participating parties jointly negotiate to obtain a quantum state secret share, which is an auxiliary value required for calculation in the online phase; Online phase: S2: Participants input real data and execute a quantum addition circuit with the secret share; S3: Participants sequentially send the results of executing the quantum addition circuit to the next participant for calculation; S4: Step S3 continues the calculation until the second-to-last participant. The last participant measures the final result and discloses the result to all participants. The specific steps of step S1 in the offline phase are as follows: 1) Each participant Randomly generated random values And convert the random value into a value of length . A binary sequence; 2) Each participant For each random value ,initialization Each quantum bit is state, traversing the above For each bit, at the position where the bit value is 1, the corresponding qubit is flipped using a quantum NOT gate, resulting in the final quantum state. , recorded as ; 3) Each participating party , to quantum state Send to the corresponding participants via a secure channel Retain a quantum state for yourself ; 4) Each participant A random quantum state is obtained by adding the quantum states received from other participants to the quantum state it retains. Recorded as auxiliary value .
2. The quantum-safe multi-party summation method based on quantum circuits according to claim 1, characterized in that, The online phase is achieved by using auxiliary values. The online phase involves summing the actual input values of the participants, and the specific steps of steps S2, S3, and S4 are as follows: 1) Each participant Input a string of length quantum state , denoted as and will and auxiliary values The addition circuit is executed to obtain , recorded as ; 2) Participating parties via secure channel Send to participants via key encryption ; 3) For participating parties Perform the following steps in sequence: a) Participating parties Users and Participants Same key decryption participants The message was sent, and the decrypted quantum state was compared with its own quantum state. Added using a quantum addition circuit; b) Participating parties The result obtained by addition via quantum addition circuitry is sent to the participants through a secure channel. Participants Do not perform this step; 4) Participating parties A quantum state result obtained by summing all values was obtained, and the result was sent to all participants.
3. The quantum-safe multi-party summation method based on quantum circuits according to claim 1 or 2, characterized in that, During the offline phase, each participant Randomly generated random values satisfy .
4. The quantum-safe multi-party summation method based on quantum circuits according to claim 1, characterized in that, The quantum adder circuit is unitary and can perform parallel computations on superposition states.