Quantum Secure Multiparty Computation based on Secure Summation and QKD

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 (\((\mathcal{B}\approx2.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.