• Corpus ID: 117003866

Security Issues Associated With Error Correction And Privacy Amplification In Quantum Key Distribution

@article{Yuen2014SecurityIA,
  title={Security Issues Associated With Error Correction And Privacy Amplification In Quantum Key Distribution},
  author={Horace P. Yuen},
  journal={arXiv: Quantum Physics},
  year={2014}
}
  • H. Yuen
  • Published 10 November 2014
  • Computer Science
  • arXiv: Quantum Physics
Privacy amplification is a necessary step in all quantum key distribution protocols, and error correction is needed in each except when signals of many photons are used in the key communication in quantum noise approach. No security analysis of error correcting code information leak to the attacker has ever been provided, while an ad hoc formula is currently employed to account for such leak in the key generation rate. It is also commonly believed that privacy amplification allows the users to… 

Figures from this paper

Security of Quantum Key Distribution
  • H. Yuen
  • Computer Science
    IEEE Access
  • 2016
The security issues facing quantum key distribution (QKD) are explained, herein focusing on those issues that are cryptographic and information theoretic in nature and not those based on physics. The

References

SHOWING 1-10 OF 30 REFERENCES
Essential lack of security proof in quantum key distribution
TLDR
It is pointed out that rigorous security guarantee of much more efficient quantum cryptosystems may be obtained by abandoning the disturbance-information tradeoff principle and utilizing instead the known KCQ (keyed communication in quantum noise) principle in conjunction with a new DBM (decoy bits method) principle that will be detailed elsewhere.
Problems of Security Proofs and Fundamental Limit on Key Generation Rate in Quantum Key Distribution
TLDR
It is shown that even for an ideal system under just collective attack, the maximum tolerable quantum bit error rate is about 1.5% and a net key cannot actually be generated with practical error correcting codes even at such low rates, contrary to claims in the literature.
Security Significance of the Trace Distance Criterion in Quantum Key Distribution
TLDR
It is demonstrated in realistic numerical examples of concrete protocols that drastic breach of security cannot yet be ruled out from trace distance security criterion d.
On the Foundations of Quantum Key Distribution - Reply to Renner and Beyond
TLDR
It is shown that Renner misrepresents the claims of Yuen and also Hirota while adopting one main theorem ofYuen in lieu of his own previous error, which leads to his incoherent position which ignores quantitative security criterion levels that undermine the current security claims.
Large Deviation Analysis for Quantum Security via Smoothing of Rényi Entropy of Order 2
  • M. Hayashi
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2014
TLDR
Using the smoothing of Rényi entropy of order 2, security bounds for L1 distinguishability and modified mutual information criterion under the classical and quantum setting are derived and exponential decreasing rates are derived.
Advances in Cryptology — CRYPTO ’96
  • N. Koblitz
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 2001
TLDR
This work presents new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, and proves that NMAC and HMAC are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.
Can Quantum Key Distribution Be Secure
TLDR
The following gives reasons on why such strong security guarantee has not been validly established and why good QKD security is difficult to obtain.
Elements of Information Theory
TLDR
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Iterative methods for the split common fixed point problem in Hilbert spaces
AbstractThe split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another
Nat
  • Commun. DOI:10.1038/ncomms (63), pp.1-6
  • 2012
...
...