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.
Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/quant-ph/1/au:+Kapourniotis_T/0/1/0/all/0/1">Theodoros Kapourniotis</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Kashefi_E/0/1/0/all/0/1">Elham Kashefi</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Leichtle_D/0/1/0/all/0/1">Dominik Leichtle</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Music_L/0/1/0/all/0/1">Luka Music</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Ollivier_H/0/1/0/all/0/1">Harold Ollivier</a>