Simple proof of security of the multiparty prepare and measure QKD

From MaRDI portal
Publication:6093091

DOI10.1007/S11128-022-03691-7arXiv2204.05215OpenAlexW4306291707WikidataQ115231722 ScholiaQ115231722MaRDI QIDQ6093091FDOQ6093091


Authors: Kumar Nilesh Edit this on Wikidata


Publication date: 6 September 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2204.05215




Recommendations



Cites Work






This page was built for publication: Simple proof of security of the multiparty prepare and measure QKD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093091)