Composable Security of Generalized BB84 Protocols Against General Attacks

• URL: http://arxiv.org/abs/2208.12154v1
• Date: Thu, 25 Aug 2022 15:20:27 GMT
• Title: Composable Security of Generalized BB84 Protocols Against General Attacks
• Abstract summary: Quantum key distribution protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum key distribution (QKD) protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable. Here we improve a security proof of BB84 given by [Biham, Boyer, Boykin, Mor, and Roychowdhury, J. Cryptology, 19(4):381-439, 2006] to be composable and match the state-of-the-art results for BB84, and we extend it to prove unconditional security of several variants of the BB84 protocol. Our composable security proof for BB84 and its variants is mostly self-contained, algebraic, and relatively simple, and it gives tight finite-key bounds.

Related papers

• Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution [21.219588497290115]
  Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel.<n>Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries.<n>No non-interactive protocol is known that provides everlasting security, even using quantum information.
  arXiv  Detail & Related papers  (2025-10-01T11:41:04Z)
• 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)
• 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)
• Security of hybrid BB84 with heterodyne detection [0.0]
  Quantum key distribution (QKD) promises everlasting security based on the laws of physics. Recent hybrid QKD protocols have been introduced to leverage advantages from both categories. We provide a rigorous security proof for a protocol introduced by Qi in 2021, where information is encoded in discrete variables.
  arXiv  Detail & Related papers  (2024-02-26T19:00:01Z)
• Comprehensive Analysis of BB84, A Quantum Key Distribution Protocol [0.0]
  Quantum Key Distribution (QKD) is a technique that enables secure communication by sharing a secret key. One of the most well-known QKD protocols is the BB84 protocol, proposed by Charles Bennett and Gilles Brassard in 1984.
  arXiv  Detail & Related papers  (2023-12-09T16:32:54Z)
• An Improved Quantum Private Set Intersection Protocol Based on Hadamard Gates [22.0983572289132]
  We find the participant can deduce the other party's private information, which violates the security requirement of private set computation. In order to solve this problem, an improved private set intersection protocol based on Hadamard gate is proposed.
  arXiv  Detail & Related papers  (2023-10-01T16:21:44Z)
• Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
  We propose a phase-matching quantum key distribution protocol without intensity modulation. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Our protocol provides a promising solution for constructing quantum networks.
  arXiv  Detail & Related papers  (2023-03-21T04:32:01Z)
• Tight finite-key analysis for mode-pairing quantum key distribution [21.81489337632085]
  We analyze the finite-key effect for the MP-QKD protocol with rigorous security proof against general attacks. We propose a six-state MP-QKD protocol and analyze its finite-key effect.
  arXiv  Detail & Related papers  (2023-02-27T02:35:52Z)
• 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)
• Succinct Classical Verification of Quantum Computation [30.91621630752802]
  We construct a classically succinct interactive argument for quantum computation (BQP) Our protocol is secure assuming the post-quantum security of indistinguishability obfuscation (iO) and Learning Errors (LWE)
  arXiv  Detail & Related papers  (2022-06-29T22:19:12Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Beyond quadratic speedups in quantum attacks on symmetric schemes [30.01567358439495]
  We report the first quantum key-recovery attack on a symmetric block cipher design, using classical queries only. Our attack shows that the structure of some symmetric constructions can be exploited to overcome this limit.
  arXiv  Detail & Related papers  (2021-10-06T15:10:31Z)
• Unbalanced-basis-misalignment tolerant measurement-device-independent quantum key distribution [22.419105320267523]
  Measurement-device-independent quantum key distribution (MDIQKD) is a revolutionary protocol since it is physically immune to all attacks on the detection side. Some protocols release part of the assumptions in the encoding system to keep the practical security, but the performance would be dramatically reduced. We present a MDIQKD protocol that requires less knowledge of encoding system to combat the troublesome modulation errors and fluctuations.
  arXiv  Detail & Related papers  (2021-08-27T02:16:20Z)
• Oblivious Transfer is in MiniQCrypt [20.72168448608258]
  MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum-time adversaries.
  arXiv  Detail & Related papers  (2020-11-30T16:51:17Z)
• 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)
• Secure BB84-type quantum key distribution with simple phase error formula [0.0]
  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.
  arXiv  Detail & Related papers  (2020-02-17T12:50:31Z)

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.