Security in Quantum Cryptography

Portmann, Christopher; Renner, Renato

doi:10.48550/arxiv.2102.00021

Cited by 14 publications

(22 citation statements)

References 246 publications

(390 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…click is Bob-Eve's measurement operator associated to observing a click in the u-th round, which acts on systems B and E and depends on all the classical information publicly announced by Alice and Bob up to that round, and |Ψ ABCE is given in Eq. (3).…”

Section: Security Proofmentioning

confidence: 99%

“…Quantum key distribution (QKD) [1][2][3][4] is arguably the most mature practical application of quantum information science, allowing to establish information-theoretic secure communications between two distant parties (commonly known as Alice and Bob) by combining the distribution of quantum systems to generate symmetric cryptographic keys with the well-known one-time-pad encryption scheme [5]. Unlike classical methods, whose security typically relies on computational assumptions, the security of QKD is only based on quantum information principles, and thus protects against any potential eavesdropper (Eve) with unlimited computational power.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Finite-Key Security Analysis of Quantum Key Distribution Against Trojan-Horse Attacks

Navarrete¹,

Curty²

2022

Preprint

View full text Add to dashboard Cite

Most security proofs of quantum key distribution (QKD) disregard the effect of information leakage from the users' devices, and, thus, do not protect against Trojan-horse attacks (THAs). In a THA, the eavesdropper injects strong light into the QKD apparatuses, and then analyzes the back-reflected light to learn information about their internal setting choices. Only a few recent works consider this security threat, but predict a rather poor performance of QKD unless the devices are strongly isolated from the channel. Here, we derive finite-key security bounds for decoy-state-based QKD schemes in the presence of THAs, which significantly outperform previous analyses. Our results constitute an important step forward to closing the existing gap between theory and practice in QKD.

show abstract

Section: Security Proofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Improved Finite-Key Security Analysis of Quantum Key Distribution Against Trojan-Horse Attacks

Navarrete¹,

Curty²

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The best-known quantum cryptographic service is quantum key distribution (QKD), in which quantum characteristics are used to assess the probability of the presence of an eavesdropper as a stream of shared, random bits is created 1 . These random, shared, believed-to-be-secret [29,69,91] bits can be used in key cryptographic protocols [2,30,60]. However, this is not the only cryptographic service that is possible; secret sharing [20,41,48,55], secure election protocols [78], and byzantine agreement protocols [9,77] are all known.…”

Section: Quantum Communication Is Desirablementioning

confidence: 99%

A Quantum Internet Architecture

Meter¹,

Satoh²,

Benchasattabuse³

et al. 2021

Preprint

View full text Add to dashboard Cite

Entangled quantum communication is advancing rapidly, with laboratory and metropolitan testbeds under development, but to date there is no unifying Quantum Internet architecture. We propose a Quantum Internet architecture centered around the Quantum Recursive Network Architecture (QRNA), using RuleSet-based connections established using a two-pass connection setup. Scalability and internetworking (for both technological and administrative boundaries) are achieved using recursion in naming and connection control. In the near term, this architecture will support end-to-end, two-party entanglement on minimal hardware, and it will extend smoothly to multi-party entanglement and the use of quantum error correction on advanced hardware in the future. For a network internal gateway protocol, we recommend (but do not require) qDijkstra with seconds per Bell pair as link cost for routing; the external gateway protocol is designed to build recursively. The strength of our architecture is shown by assessing extensibility and demonstrating how robust protocol operation can be confirmed using the RuleSet paradigm.

show abstract

“…Let Alice and Charlie be honest and let Bob be dishonest. Bob implements the following man-in-themiddle attack with the effect that o = o ′ [48,49].…”

Section: Composabilitymentioning

confidence: 99%

Unconditionally secure relativistic multi-party biased coin flipping and die rolling

Pitalúa-García

2021

Preprint

View full text Add to dashboard Cite

We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to M ≥ 2 parties and to N ≥ 2 outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implement with current technology, and to our knowledge are the first multi-party relativistic cryptographic protocols.

show abstract

Security in Quantum Cryptography

Cited by 14 publications

References 246 publications

Improved Finite-Key Security Analysis of Quantum Key Distribution Against Trojan-Horse Attacks

Improved Finite-Key Security Analysis of Quantum Key Distribution Against Trojan-Horse Attacks

A Quantum Internet Architecture

Unconditionally secure relativistic multi-party biased coin flipping and die rolling

Contact Info

Product

Resources

About