Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
arXiv:2303.08865
Abstract
Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a composably and statistically secure way, even for a single honest party. Unlike previous quantum SMPC protocols, our proposal only requires very limited quantum resources from all but one party; it suffices that the weak parties, i.e. the clients, are able to prepare single-qubit states in the X-Y plane. The novel quantum SMPC protocol is constructed in a naturally modular way, and relies on a new technique for quantum verification that is of independent interest. This verification technique requires the remote preparation of states only in a single plane of the Bloch sphere. In the course of proving the security of the new verification protocol, we also uncover a fundamental invariance that is inherent to measurement-based quantum computing.
arXiv comment27+10 pages, 5 figures. This work supersedes arXiv:2102.12949
References in corpus (15)
- Multi-party entanglement in graph states
- Unconditionally verifiable blind computation
- Determinism in the one-way model
- Universally Composable Quantum Multi-Party Computation
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Composable security of delegated quantum computation
- Multiparty Delegated Quantum Computing
- Secure two-party quantum evaluation of unitaries against specious adversaries
- Optimised resource construction for verifiable quantum computation
- Reducing resources for verification of quantum computations
- QEnclave -- A practical solution for secure quantum cloud computing
- Secure multi-party quantum computation with few qubits
- The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation
- Composable secure multi-client delegated quantum computation
- Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds