Hybrid Quantum Protocols for Secure Multiparty Summation and Multiplication

Area of Science:

• Quantum Information Science
• Cryptography
• Computer Science

Background:

• Secure multiparty computation is crucial for privacy-preserving data analysis.
• Existing quantum summation and multiplication protocols often use an (n, n) threshold and bit-by-bit computation.
• These limitations hinder efficiency and flexibility in quantum cryptographic applications.

Purpose of the Study:

• To propose novel hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication.
• To enhance the security and computational efficiency of quantum secret sharing schemes.
• To enable secret-by-secret computation with modulo arithmetic in a distributed quantum environment.

Main Methods:

• Utilized Shamir's secret sharing for threshold cryptography.
• Incorporated SUM gate and Quantum Fourier Transform for quantum operations.
• Employed generalized Pauli operators for secure information processing.
• Developed protocols for secret-by-secret computation with modulo d (where d is a prime, n ≤ d ≤ 2n).

Main Results:

• Introduced two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication.
• Demonstrated resistance against various quantum attacks including intercept-resend, entangle-measure, collusion, collective, and coherent attacks.
• Achieved improved computation and communication costs compared to existing (n, n) threshold protocols.
• Ensured that no individual player can access the private inputs of other participants.

Conclusions:

• The proposed (t, n) threshold quantum protocols offer a more flexible and secure approach to multiparty quantum computation.
• These protocols provide enhanced security guarantees and better resource efficiency for quantum summation and multiplication.
• The secret-by-secret computation model advances the practical implementation of secure quantum information processing.