Verifiable Quantum Secure Modulo Summation
arXiv:1910.05976 · doi:10.1007/s11128-022-03639-x
Abstract
We propose a new cryptographic task, which we call verifiable quantum secure modulo summation. Secure modulo summation is a calculation of modulo summation when players have their individual variables 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. If we combine device independent quantum key distribution, it is possible to verify such secret communication channels. However, it consumes so many steps. To resolve this problem, using quantum systems, we propose a more direct method to realize secure modulo summation with verification. To realize this protocol, we propose modulo zero-sum randomness as another new concept, and show that secure modulo summation can be realized by using modulo zero-sum randomness. Then, we construct a verifiable quantum protocol method to generate modulo zero-sum randomness. This protocol can be verified only with minimum requirements.
References in corpus (19)
- Device-independent security of quantum cryptography against collective attacks
- Device-independent quantum key distribution secure against collective attacks
- Experimental Demonstration of Blind Quantum Computing
- Universal blind quantum computation
- Self-testing of quantum systems: a review
- Robust Self Testing of the Singlet
- All Pure Bipartite Entangled States can be Self-Tested
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Experimental verification of quantum computations
- Experimental Blind Quantum Computing for a Classical Client
- Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
- Secure multi-party quantum summation based on quantum Fourier transform
- Practical quantum computing on encrypted data
- Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems
- Self-guaranteed measurement-based quantum computation
- Verifiable fault-tolerance in measurement-based quantum computation
- Generalized self-testing and the security of the 6-state protocol
- Multi-party quantum summation based on quantum teleportation