Most of the existing quantum secure multiparty multiplications use entangled states to carry secret information. However, the preparation of these quantum states is difficult. In order to solve this problem, a single-particle secure multiparty product protocol based on a d-level Lagrange unitary operator is proposed. In this protocol, a semi-honest third party (Server) and each participant share a private key. The participant first uses the private key and random number to multiply his own secret integer with module d, and then he uses Lagrange unitary operator to encode the calculation result into an unbiased basis particle. The server obtains the encoded information by measuring the particle sent back by each participant. Finally, the server uses the module d product of all the random numbers sent by the participant’s representative to calculate the product corresponding to the secret integers of multiple participants. Performance analysis shows that, compared with similar protocols, the proposed protocol requires less of the entity’s quantum computing capabilities. In terms of security, this protocol can resist both external and internal attacks. Finally, the proposed protocol uses the Q# quantum programming language combined with Python language to simulate and verify its correctness.
Most of the existing quantum secure multiparty multiplications use entangled states to carry secret information. However, the preparation of these quantum states is difficult. In order to solve this problem, a single-particle secure multiparty product protocol based on a d-level Lagrange unitary operator is proposed. In this protocol, a semi-honest third party (Server) and each participant share a private key. The participant first uses the private key and random number to multiply his own secret integer with module d, and then he uses Lagrange unitary operator to encode the calculation result into an unbiased basis particle. The server obtains the encoded information by measuring the particle sent back by each participant. Finally, the server uses the module d product of all the random numbers sent by the participant’s representative to calculate the product corresponding to the secret integers of multiple participants. Performance analysis shows that, compared with similar protocols, the proposed protocol requires less of the entity’s quantum computing capabilities. In terms of security, this protocol can resist both external and internal attacks. Finally, the proposed protocol uses the Q# quantum programming language combined with Python language to simulate and verify its correctness.
As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant's computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.
The quantum secure multiparty multiplication (QSMM) protocol aims to leverage the advantages of quantum computing to ensure data privacy and security in multiparty computation, preventing information from being leaked and protecting privacy against malicious attacks. However, current QSMM protocols suffer from high resource consumption and computation complexity in particle preparation and participant computation stages. In view of this, a QSMM protocol based on single particles is proposed in this paper. The proposed protocol utilizes high-dimensional single particles as information carriers, and the optimized quantum multiplication circuit is employed to embed the participants’ secret message and perform the multiplication. All participants collaboratively generate a blind matrix, and each column product of the blind matrix acts as the participant’s private key for the blinding of the secret value. Unlike other protocols that use decoy particles for eavesdropping detection, the proposed protocol leverages the properties of mutually unbiased basis particles to ensure its security, while reducing quantum resource consumption and the quantum capabilities required from the participants. Security analysis demonstrates that the proposed protocol can effectively resist attacks from external eavesdroppers and internal participants, and performance analysis shows that the proposed protocol achieves superior execution efficiency compared to other similar protocols.
Abstract In this paper, by utilizing d -dimensional single-particle states, three semiquantum cryptography protocols, i.e., the multi-party semiquantum private comparison (MSQPC) protocol, the multi-party semiquantum multiplication (MSQM) protocol and the multi-party semiquantum summation (MSQS) protocol, can be achieved simultaneously under the assistance of two semi-honest quantum third parties (TPs). Here, the proposed MSQPC scheme is the only protocol which is devoted to judging the size relationship of secret integers from more than two semiquantum participants without a pre-shared key. And the proposed MSQM protocol absorbs the innovative concept of semiquantumness into quantum multiplication for the first time, which can calculate the modulo d multiplication of private inputs from more than two semiquantum users. As for the proposed MSQS protocol, it is the only semiquantum summation protocol which aims to accomplish the modulo d addition of more than three semiquantum users’ private integers. Neither quantum entanglement swapping nor unitary operations are necessary in the three proposed protocols. The security analysis verifies in detail that both the external attacks and the internal attacks can be resisted in the three proposed protocols.
In this paper,a quantum private comparison protocol based on d dimensional single-particle states is proposed. In the protocol,a semi-honest third party transfers a sequence of n particles to one participant w ho encodes n secret keys by performing n local unitary operations. Then these particles are sent to the other participant w ho also by the same w ay encodes n secret keys and returns these particles back to the semi-honest party. Finally after the participants broadcast the results of encrypting their secrets w ith secret keys,the semi-honest third party can help the tw o participants compare the size relationships of their n pair corresponding secrets w ithout disclosing them to any other people. In addition,the security of the protocol is also discussed in detail. It is show n that the protocol is secure in theory. Moreover,since only single-particle states are used,as compared w ith other quantum private comparison protocols,the presented protocol is more feasible under the current technical conditions.
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.
Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.