Paper 2023/379 Original: eprint.iacr.org/2023/379 ↗
Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-03-15: last updated
- 2023-03-15: published
- Short URL
- https://ia.cr/2023/379
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2023/379,
author = {Theodoros Kapourniotis and Elham Kashefi and Dominik Leichtle and Luka Music and Harold Ollivier},
title = {Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/379},
year = {2023},
url = {https://eprint.iacr.org/2023/379}
}