In this paper, a novel quantum secure multiparty summation protocol is proposed based on the mutually unbiased bases of d-level quantum systems. The quantum states of mutually unbiased bases, which are transmitted in a circular pattern, are imposed with the transformation operations of n secrecy owners to encode their secrecies. Security analysis reveals that the proposed protocol can resist outside attacks as well as participant attacks. The proposed protocol is suitable for d-level quantum systems and can calculate the modulo d addition using the integer-by-integer technique. Compared with the quantum secure summation protocols with bit-by-bit calculations, the proposed protocol has a higher calculation efficiency and has more extensive applications compared with the protocols with smaller modulo. Moreover, this protocol can be successfully used for quantum multiparty private comparison and quantum multiparty anonymous voting.
In this paper, a novel quantum secure multiparty summation protocol is proposed based on the mutually unbiased bases of d-level quantum systems. The quantum states of mutually unbiased bases, which are transmitted in a circular pattern, are imposed with the transformation operations of n secrecy owners to encode their secrecies. Security analysis reveals that the proposed protocol can resist outside attacks as well as participant attacks. The proposed protocol is suitable for d-level quantum systems and can calculate the modulo d addition using the integer-by-integer technique. Compared with the quantum secure summation protocols with bit-by-bit calculations, the proposed protocol has a higher calculation efficiency and has more extensive applications compared with the protocols with smaller modulo. Moreover, this protocol can be successfully used for quantum multiparty private comparison and quantum multiparty anonymous voting.
Abstract Quantum secure multiparty computation occupies an important place in quantum cryptography. Based on access structure and linear secret sharing, we propose a new general quantum secure multiparty computation protocol for simultaneous summation and multiplication in a high-dimensional quantum system. In our protocol, each participant within any authorized sets only needs to perform local Pauli operation once on the generalized Bell state, then the summation and multiplication results can be output simultaneously, which improves the practicality of the protocol. Moreover, in the privacy computation phase, the decoy particle detection technique as well as the addition of random numbers are applied to blind the privacy information, making our protocol higher privacy protection. Security analysis shows that our protocol is resistant to a series of typical external attacks and dishonest internal participant attacks such as individual attack and collusion attack. Finally, compared with the existing protocols, our protocol not only has higher efficiency but also lower consumption.
Abstract The research of quantum secure multiparty computation is a subject of great importance in modern cryptography. In this study, we construct a verifiable quantum protocol for dynamic secure multiparty summation based on the cyclic property of d-level MUBs. Our protocol can realize dynamic parameter update in the aspect of members and secret inputs, improving the practicality of the protocol. Moreover, a verification mechanism for result checking by applying ElGamal homomorphic encryption is given, and further enables the detectability of cheating behaviors, making our protocol safer. The security analysis proves the proposed protocol not only can resist a range of typical attacks from outside and inside, but also is secure against dishonest revoked participant attack which has been neglected in previous dynamic quantum summation protocols. From a theoretical perspective, compared with existing summation protocols, the protocol provides better practicability, higher privacy protection, and higher efficiency.
The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.
In this paper, a quantum secure multi-party summation scheme with a third party based on quantum Fourier transform (QFT) is put forward, where the third party cannot be permitted to cooperate with others but is allowed for all kinds of attacks. Under the help of third party, [Formula: see text] users can calculate the addition modulo [Formula: see text] of their private integer strings. The third party generates two-level single qubit and its product state as the initial quantum resource, produces the traveling particles with QFT and the controlled-not (CNOT) operations, and sends the traveling particles out to the first users; then, [Formula: see text] users encode their private integer sequences by performing the phase shifting operations on the travelling particles one after another; and finally, the third party decodes out the summation of the private integer sequences from [Formula: see text] users through CNOT operations and inverse quantum Fourier transform (IQFT). This protocol only adopts two-level single particle state and its product state as initial quantum resource, only needs [Formula: see text]-level single particle measurement and does not need to perform quantum entanglement swapping. Security analysis indicates that this protocol can overcome not only the outside attack but also the participant attack.
With the rapid advancement of information technology, data sharing has become increasingly accessible, leading to a heightened need for robust personal data protection. One important application in privacy-preserving computing is the aggregation of information when collaboratively establishing AI models through public distributed networks. To counter the threat posed by quantum computing to encrypted data, various quantum private summation (QPS) protocols have been proposed thus far. However, some of these existing protocols operate solely under modulo 2, while other approaches for modulo d often rely on impractically high-dimensional qudits. Therefore, this study proposes an innovative multiparty QPS method that balances participant data sharing and privacy without requiring high-dimensional photons. The proposed QPS protocol enables participants to contribute aggregated information to third parties without disclosing individual data. A security analysis further demonstrates that the proposed QPS effectively counters common eavesdropping attacks, ensuring reliable protection of personal data.
This paper presents a novel quantum secure multi-party summation protocol based on one-direction quantum walks on a circle (ODQWC), which allows the summation computation of different integer sequences from “n” secret holders. Crucially, it ensures that this process does not infringe on the privacy of these secret holders by delivering quantum walk states in a circular pattern. Our proposed protocol employs two-particle product states rather than quantum entangled states as the initial quantum resource and eliminates the need for different secret holders to perform quantum entanglement swapping operations. Instead, it emphasizes imposing one-direction evolution operators on quantum walk states. Additionally, our protocol requires single-particle measurements. Security analysis validates that our proposed protocol can effectively counter external attacks and those initiated by participants. Under specific conditions, our proposed protocol can be adapted into a quantum secure multi-party bit summation protocol based on ODQWC.