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.
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.
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.
Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.
Abstract Secure Multiparty Computation (MPC) is a cryptography technique that allows multiple parties to securely perform operations on their private inputs without revealing them. It is used in various applications, such as data aggregation in the cloud, IoT, etc., where data privacy is the prime concern. Many researchers have explored ways to develop secure protocols with minimal risk of data leakage. Many of these classical secure MPC protocols depend on classical random number generators. However, advances in quantum information processing are putting classical key distribution methods at risk. Traditional summation protocols adopt an ((n,n)) threshold approach, requiring the participation of all (n) players to compute the sum securely. However, the proposed quantum secure multiparty computation based on secure summation and QKD (QSMPC-SSQKD) introduces a generalised quantum secure multiparty summation protocol. The proposed protocol utilises entanglement, a fundamental property of quantum mechanics, to facilitate safe key exchange, thereby ensuring robust security measures. We use a quantum random number generator (QRNG) to generate true random numbers, ensuring privacy preservation. The protocol achieves a per-bit entropy level of 0.708 through QRNG, which provides strong randomness. The security of the proposed protocol is validated using the CHSCH test ((B≈2.8)), ensuring that any attempt to eavesdrop on the system can be detected, and the complete process will be rescheduled. Compared to some similar protocols, the proposed QSMPC-SSQKD protocol provides higher randomness and lower quantum circuit cost without using any trusted third party (TTP). This improvement enhances the protocol’s efficiency and practicality in preventing data leakage during computation.
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.
Abstract In this paper, we propose a measurement-device-independent (MDI) quantum secure multiparty summation protocol based on entanglement swapping. The protocol is capable of providing a secure modulo-2 summation method for n parties. Our protocol uses Bell states as the information vehicle and establishes encryption through entanglement swapping, and each party encodes the information orderly to complete the summation process through the simple single-qubit operation. In contrast to previous protocols, there is no pre-shared private key sequence and key storage process in our protocol, which helps to reduce the possibility of information leakage in transmission. Our protocol supports multiple summations by n participants, which improves quantum resource utilization. The protocol can be implemented with linear-optical devices. Furthermore, it can resist multiple attack modes including the intercept-resend attack, entangle-and-measure attack, dishonest third-party attack, and parties’ attack. Most significantly, the protocol enables to eliminate all side-channel attacks against detectors based on the MDI principle. Therefore, the protocol has advantages of high security, high efficiency, and good feasibility.
ABSTRACT Private computation has become an increasingly important trend. It can be achieved either through traditional methods, such as homomorphic encryption, or by implementing various quantum protocols. Most existing protocols for quantum multiparty summation rely on quantum Fourier transforms and the generation of high‐dimensional entangled states. This paper presents a highly efficient quantum multiparty summation protocol that requires only shift operations applied to ‐level quantum systems (qudits), significantly simplifying its implementation. Furthermore, the number of values that each participant can express scales with the number of photons, without requiring higher‐dimensional quantum states. This study adopts a circular model for quantum transmission to ensure that no participant gains an advantage regarding information leakage based on the order of participation.