Secure BB84-type quantum key distribution with simple phase error formula

• URL: http://arxiv.org/abs/2002.06921v3
• Date: Thu, 18 Jun 2020 01:31:31 GMT
• Title: Secure BB84-type quantum key distribution with simple phase error formula
• Abstract summary: simplified BB84 protocol with only three states preparation and measurement has showed the approximate secret key rate with standard BB84. We provide a security proof against the coherent attack, which simultaneously removes the basis-independent detection efficiency condition. We expect that the simplified BB84 protocol with decoy-state method can be widely implemented in reality.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: BB84-based quantum key distribution system is limited in high speed and chip integration due to the requirement of four states preparation and measurement. Recently, the simplified BB84 protocol with only three states preparation and measurement has showed the approximate secret key rate with standard BB84. However, the security proof is only valid under the collective attack and requires the basis-independent detection efficiency condition. Here, we provide a security proof against the coherent attack, which simultaneously removes the basis-independent detection efficiency condition. Importantly, the phase error rate formula is quite simple through a subtle observation. We expect that the simplified BB84 protocol with decoy-state method can be widely implemented in reality.

Related papers

• Security of quantum key distribution with passive basis choice and detection-efficiency mismatch for a realistic satellite setup [39.146761527401424]
  Detection-efficiency mismatch is a common problem in quantum key distribution systems.<n>We present a more precise estimation of the secret key rate for the BB84 protocol with the passive basis choice.
  arXiv  Detail & Related papers  (2026-08-10T16:14:36Z)
• Finite-key security analysis of the decoy-state BB84 QKD with passive measurement [0.509780930114934]
  Bennett-Brassard 1984 (BB84) quantum key distribution protocol is widely regarded as the de facto standard for practical implementations.<n>On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators.<n>Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking.
  arXiv  Detail & Related papers  (2025-11-26T10:37:36Z)
• Security of the BB84 protocol with receiver's passive biased basis choice [0.0]
  Bennett-Brassard 1984 protocol (BB84 protocol) is one of the simplest protocols for implementing quantum key distribution (QKD)<n>In the protocol, the sender and the receiver iteratively choose one of two complementary measurement bases.<n>We present a fully analytical security proof for such a decoy-state BB84 protocol with receiver's passive basis choice and measurement with threshold detectors.
  arXiv  Detail & Related papers  (2025-07-06T05:18:45Z)
• Loss-tolerant quantum key distribution with detection efficiency mismatch [39.58317527488534]
  We establish a security proof for the loss-tolerant P&M QKD protocol that incorporates imperfections in both the source and the detectors. Specifically, we demonstrate the security of this scheme when the emitted states deviate from the ideal ones.
  arXiv  Detail & Related papers  (2024-12-12T19:01:56Z)
• Decoherence-assisted quantum key distribution [37.69303106863453]
  We show that our method reduces the amount of information that an eavesdropper can obtain in the BB84 protocol under the entangling probe attack. We demonstrate experimentally that Alice and Bob can agree on a scheme to that gives low values of the quantum bit error rate.
  arXiv  Detail & Related papers  (2024-05-30T15:28:07Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Modified BB84 quantum key distribution protocol robust to source imperfections [1.53934570513443]
  Bennett-Brassard 1984 (BB84) protocol is the most widely implemented quantum key distribution scheme. We prove the security of the BB84 protocol in the presence of multiple source imperfections. We show that the addition of a fourth state, while redundant in ideal conditions, significantly improves the estimation of the leaked information.
  arXiv  Detail & Related papers  (2022-10-21T06:23:01Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Comment on "Scheme of the arrangement for attack on the protocol BB84" [0.0]
  A protocol was proposed for using weak measurement to attack BB84. We show this attack fails when considered using standard quantum mechanics, as expected.
  arXiv  Detail & Related papers  (2021-06-16T11:36:12Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Simplified BB84 quantum key distribution secure against coherent attacks [0.0]
  Decoy-state quantum key distribution (QKD) has convincingly been shown the core solution to secure key exchange. We provide the finite-key security bounds for decoy-state simplified BB84 QKD against coherent attacks. We conclude that simplified BB84 can completely replace standard BB84 to be the best choice for QKD in most common practical scenarios.
  arXiv  Detail & Related papers  (2020-03-18T15:18:43Z)
• Experimental composable security decoy-state quantum key distribution using time-phase encoding [19.037123608278602]
  We provide the rigorous finite-key security bounds for four-intensity decoy-state BB84 QKD against coherent attacks. We build a time-phase encoding system with 200 MHz clocked to implement this protocol, in which the real-time secret key rate is more than 60 kbps over 50 km single-mode fiber.
  arXiv  Detail & Related papers  (2020-02-25T04:59:43Z)
• Tight security bounds for decoy-state quantum key distribution [1.1563829079760959]
  The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol. Here, we provide the rigorous and optimal analytic formula to solve the above tasks. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
  arXiv  Detail & Related papers  (2020-02-16T07:48:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.