Asymmetric quantum secure multi-party computation with weak clients against dishonest majority

Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier

Research output: Working paperPreprint

Abstract / Description of output

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.
Original languageEnglish
PublisherArXiv
Pages1-37
Number of pages37
DOIs
Publication statusPublished - 15 Mar 2023

Keywords / Materials (for Non-textual outputs)

  • quantum verification
  • delegated computation
  • secure multi-party computation
  • distributed quantum computing

Fingerprint

Dive into the research topics of 'Asymmetric quantum secure multi-party computation with weak clients against dishonest majority'. Together they form a unique fingerprint.

Cite this