Simple Proof of Security of the multiparty Prepare and Measure QKD

TL;DR

This paper presents a simple, practical security proof for multiparty quantum key distribution using prepare-and-measure techniques, reducing the need for complex entangled states.

Contribution

It provides a straightforward security proof for multiparty QKD that relies only on preparing and measuring single qubits, simplifying implementation.

Findings

Security established via reduction from entangled-based protocols

Utilizes quantum error correction and entanglement purification techniques

Proves conditional security of the prepare-and-measure scheme

Abstract

The majority of research to date has concentrated on the quantum key distribution (QKD) between two parties. In general, the QKD protocols proposed for the multiparty scenario often involve the usage of a maximally entangled state, such as GHZ, which is challenging to implement in practice. This paper examines the prepare and measure version of multiparty communication through quantum key distribution. It is sufficient to have the capability of preparing and measuring a single qubit state. The security of the multiparty prepare and measure QKD is demonstrated by utilizing the well-known techniques of quantum error correction and entanglement purification. We begin by establishing the security of the entangled-based version and progress through a series of reductions to arrive at our equivalent multiparty prepare and measure version of QKD. We establish the security proof of multiparty entangled-based version by combining FTQC and classical statistics on the GHZ basis. Then proved the conditional security of the multiparty prepare-and-measure QKD by the equivalency.