As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.
As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.
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.
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.
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.
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.
Secure multiparty computation is a basic cryptographic primitive that has many important applications in privacy preservation. In this work, we propose a new secure multiparty computation protocol for the maximum and minimum values based on quantum homomorphic encryption. Owing to the speciality of quantum homomorphic encryption, participants can delegate a server to compute the maximum and minimum values of their private data. Furthermore, both calculations are performed on the encrypted data, and therefore the privacy of their respective private data can be perfectly guaranteed.
With the recent development in quantum computers, the classical cryptographic tools may need to be upgraded and ensure that they must be quantum resistant. Secure multiparty is one of the important cryptographic protocols, with this a team of n-players can jointly compute a function, in such a way that the input of the function will be anonymous. In this paper, we have proposed a secure multiparty summation protocol for multiparty computation in a distributed environment. In this protocol out of n, the initiator selects k players, which will compute partial summation and send these partial results to the initiator. Here the initiator plays an important role and members elect the initiator by a voting function.