Verifiable Quantum Secure Modulo Summation

Understand

We propose a new cryptographic task, which we call verifiable quantum secure modulo summation.

• Secure modulo summation is a calculation of modulo summation $Y_1+\ldots+ Y_m$ when $m$ players have their individual variables $Y_1,\ldots, Y_m$ with keeping the secrecy of the individual variables.
• However, the conventional method for secure modulo summation uses so many secret communication channels.
• We say that a quantum protocol for secure modulo summation is quantum verifiable secure modulo summation when it can verify the desired secrecy condition.