Quantum secure two-party Euclidean distance computation based on mutually unbiased bases

Quantum secure multi-party geometry computation is a specific primitive of classical secure multi-party computation. Compared with classical secure multi-party geometry computation based on mathematical difficulty problems which have been potentially threatened due to the development of quantum computer technology, the quantum protocol can provide unconditional security for the geometry computation. A novel quantum protocol based on the mutually biased bases of d-level quantum system is constructed to perform secure two-party Euclidean distance computation. With the aid of a semi-honest third party, the proposed protocol can calculate the Euclidean distance between two secret n-dimensional coordinates held by the participants who do not trust each other. Not only can the protocol resist the attacks from both outside eavesdroppers and participants, but also from semi-honest third party who does not collude with any participant.

Automated summary

This article introduces a novel quantum protocol for quantum secure multi-party geometry computation, which provides unconditional security for Euclidean distance computation and can withstand various attacks.