pith. sign in

arxiv: 1109.1051 · v3 · pith:6GXYMF45new · submitted 2011-09-06 · 🪐 quant-ph

Problems of Existing Unconditional Security Proofs in Quantum Key Distribution

classification 🪐 quant-ph
keywords securityquantumdistributionunconditionalexistingproblemsproofsamplification
0
0 comments X
read the original abstract

It is repeatedly and persistently claimed in the literature that a specific trace criterion $d$ would guarantee universal composition security in quantum cryptography. Currently that is the sole basis of unconditional security claim in quantum key distribution. In this paper, it is shown that just security against known-plaintext attacks when the generated key is used in direct encryption is not provided by $d$. The problem is directly connected with several general problems in the existing unconditional security proofs in quantum key distribution. A number of issues will be clarified concerning the nature of true security, privacy amplification, key generation rate and the mathematical approach needed for their determination in concrete protocols.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.