Abstract In this paper, we consider an interesting and important privacy-preserving issue, i.e., how to implement anonymous and secure communications for several intelligence agents, hiding in n participants. To solve this issue, we first propose a quantum Secure Multiparty Computing XOR (SMC_XOR) protocol based on single photons, which can guarantee the unconditional security of the protocol. By implementing rotation encryption, the practicality of quantum SMC_XOR protocol can be significantly improved without other complex quantum techniques. Security analysis shows that the proposed protocol can resist various types of attacks. Furthermore, a special network model is designed to solve this issue, using hash function to verify the identity of the communication parties and key recycling to reduce resource consumption. Finally, the proposed quantum SMC_XOR protocol is simulated in IBM Qiskit, and the simulation results show that the protocol is correct and feasible.
Abstract In this paper, we consider an interesting and important privacy-preserving issue, i.e., how to implement anonymous and secure communications for several intelligence agents, hiding in n participants. To solve this issue, we first propose a quantum Secure Multiparty Computing XOR (SMC_XOR) protocol based on single photons, which can guarantee the unconditional security of the protocol. By implementing rotation encryption, the practicality of quantum SMC_XOR protocol can be significantly improved without other complex quantum techniques. Security analysis shows that the proposed protocol can resist various types of attacks. Furthermore, a special network model is designed to solve this issue, using hash function to verify the identity of the communication parties and key recycling to reduce resource consumption. Finally, the proposed quantum SMC_XOR protocol is simulated in IBM Qiskit, and the simulation results show that the protocol is correct and feasible.
This study first defined a new privacy protection problem, namely, quantum secure multiparty logical XOR (SMC_ XOR), and then designed corresponding quantum circuits where multiple participants could jointly calculate the logical XOR of their respective private bits. The proposed quantum SMC_XOR protocol can ensure unconditional security, i.e., information-theoretical security. Furthermore, we designed a grouping strategy to reduce communication complexity and presented an improved quantum SMC_XOR protocol. The improved quantum protocol is used to secure communication in metropolitan area networks, allowing two remote users to securely transmit confidential messages. Finally, we verified the correctness and feasibility of the proposed quantum SMC_XOR protocol by conducting circuit simulations on the IBM quantum system in Qiskit.
Abstract In this paper, we first define a primitive protocol of secure multiparty computations to privately compute the logic operator “OR” (SMC_OR). Accordingly, we design a feasible quantum SMC_OR protocol by using single photons, which can achieve information-theoretical security in the semi-honest model. Furthermore, we adopt the proposed quantum SMC_OR protocol to solve an interesting but important privacy-preserving problem, i.e., finding the maximum value among many secrets. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.
This study proposes a multiparty single-photon semi-quantum secret sharing (SQSS) protocol to simultaneously improve quantum bit (qubit) efficiency and practical feasibility. Existing quantum secret sharing protocols typically assume that all participants possess full quantum capabilities, which limits their deployment in real-world environments. To address this issue, the proposed protocol was designed using a semi-quantum model, allowing N agents with limited quantum capabilities to participate in the secret-sharing process. In terms of efficiency, the proposed protocol employs single photons as quantum resources and is analyzed under a unified definition of qubit efficiency. The results show that the qubit efficiency of the proposed protocol reaches 2N1 , which is comparable to the best recent quantum secret sharing protocols and outperforms most existing SQSS methods. Unlike certain protocols in which qubit efficiency decreases exponentially with the number of participants, the quantum resource consumption of the proposed protocol increases linearly with the number of agents. Consequently, its qubit efficiency decreases proportionally to N1 , rather than exponentially, providing better scalability as the number of agents increases. In terms of security, the protocol is analyzed against several attack models, including intercept-resend, entangle-and-measure, collective, and collusion attacks. The analysis shows that an adversary cannot obtain useful information without detection under these attacks, demonstrating the robustness of the proposed protocol.
Abstract With the rapid development of distributed collaborative computing, privacy leakage risks in multi-source data joint analysis are increasing, and classical secure scalar product (SSP) protocols are vulnerable to quantum attacks. Existing quantum secure scalar product schemes mostly rely on complex quantum resources or third parties, only support two-party computation, and have poor scalability. To address these issues, this paper proposes a secure multi-party quantum scalar product protocol based on single-photon resources without a third party. The protocol adopts a two-layer architectural design, integrating pairwise secure product operation and privacy-preserving aggregation mechanism. It realizes result blinding via data splitting and reconstruction to fully guarantee data confidentiality. By adopting ring interaction structure and lightweight secure computing modes, it completes collaborative computation of multi-party private data and effectively prevents information leakage in interactive processes. Performance analysis shows that the protocol requires no more than single-photon and single-particle measurements, with complexity within a reasonable range, making it feasible with current quantum technology. This protocol provides an efficient and secure primitive for multi-party privacy-preserving collaborative computing in quantum-resistant scenarios.
In quantum secure multi-party summation protocols, some attackers can impersonate legitimate participants in the summation process, and easily steal the summation results from the participants. This is often overlooked for existing secure multi-party summation protocols, thus rendering them insecure. Based on commutative encryption, a quantum secure multi-party summation protocol with identity authentication is proposed in this paper. In the protocol, each participant encodes a secret integer on photons via unitary operations. At the same time, a one-way hash function technique with a key is utilized to perform identity authentication operations for each participant. Finally, the summation is calculated with the help of a semi-trusted third party. The analysis of the protocol shows that the proposed protocol is correct and resistant to common and impersonation attacks. Compared to related protocols, the use and measurement of single photons makes the protocol easier to implement into existing technology. Furthermore, the simulation experiments on the IBM Q Experience cloud platform demonstrate the effectiveness of the presented protocol.
In order to reduce the requirements on quantum devices, Shih proposed two three-party quantum key distribution (QKD) protocols . However, Gao presented a simple and effective attack strategy (i.e., dense-coding attack) upon the two protocols . In this paper, we make a deep analysis on the reason why Shih three-party QKD protocols are not secure. Meanwhile, we improve the three-party QKD protocols so that they can resist the Gao attack. On this basis, we present a formalism of single-photon multiparty quantum cryptographic protocol with collective detection. In this formalism, single photons are employed and all participants, except one whom we call as the center, only need to have the ability to perform single qubit unitary operations. Considering the expensive quantum devices, this formalism is low-priced which means it is easy to realize. Further more, this formalism can be widely used in various quantum cryptographic protocols, such as quantum secret sharing, quantum coin flipping, and quantum secure direct communication.