Key Rate Analysis of a 3-State Twin-Field Quantum Key Distribution Protocol in the Finite-key Regime

• URL: http://arxiv.org/abs/2305.18006v2
• Date: Tue, 30 May 2023 14:08:46 GMT
• Title: Key Rate Analysis of a 3-State Twin-Field Quantum Key Distribution Protocol in the Finite-key Regime
• Authors: Matt Young, Darius Bunandar, Marco Lucamarini, Stefano Pirandola
• Abstract summary: The Secret Key Rate is the number of bits per transmission that result in being part of a Secret Key between two parties. Work by Bunandar et al. has produced code that used Semi-Definite Programming to produce lower bounds on the Secret Key Rate of even Asymmetric protocols.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When analysing Quantum Key Distribution (QKD) protocols several metrics can be determined, but one of the most important is the Secret Key Rate. The Secret Key Rate is the number of bits per transmission that result in being part of a Secret Key between two parties. There are equations that give the Secret Key Rate, for example, for the BB84 protocol, equation 52 from [1, p.1032] gives the Secret Key Rate for a given Quantum Bit Error Rate (QBER). However, the analysis leading to equations such as these often rely on an Asymptotic approach, where it is assumed that an infinite number of transmissions are sent between the two communicating parties (henceforth denoted as Alice and Bob). In a practical implementation this is obviously impossible. Moreover, some QKD protocols belong to a category called Asymmetric protocols, for which it is significantly more difficult to perform such an analysis. As such, there is currently a lot of investigation into a different approach called the Finite-key regime. Work by Bunandar et al. [2] has produced code that used Semi-Definite Programming to produce lower bounds on the Secret Key Rate of even Asymmetric protocols. Our work looks at devising a novel QKD protocol taking inspiration from both the 3-state version of BB84 [3], and the Twin-Field protocol [4], and then using this code to perform analysis of the new protocol.

Related papers

• 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)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Scalable Mediated Semi-quantum Key Distribution [5.548873288570182]
  Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP) Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios.
  arXiv  Detail & Related papers  (2022-05-13T09:21:12Z)
• Numerical Method for Finite-size Security Analysis of Quantum Key Distribution [1.2891210250935146]
  We develop a finite-size security analysis against general attacks for general QKD protocols. Our result shows that the finite-size key rate can surpass the linear key-rate bound in a realistic communication time.
  arXiv  Detail & Related papers  (2021-11-16T09:10:56Z)
• 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)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• 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)
• Quantum Key-Distribution Protocols Based on a Quantum Version of the Monty Hall Game [0.0]
  The study proposed two quantum key-distribution protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott. The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates.
  arXiv  Detail & Related papers  (2020-05-11T22:06:30Z)
• A polarization quantum key distribution scheme based on phase matching [0.0]
  The Quantum Key Distribution protocol can encode a single quantum state and implements an information-theoretically secure key distribution protocol in communication. This paper successfully gives the polarization scheme of this PM-QKD protocol, the bases in the polarization scheme are arbitrary, and eliminates detector side channel attacks. The simulation results show that our protocol is superior to the BB84 protocol in terms of transmission distance under the fixed key rate.
  arXiv  Detail & Related papers  (2020-03-02T10:33:18Z)
• The phase matching quantum key distribution protocol with 3-state systems [0.0]
  Quantum Key Distribution, as a branch of quantum mechanics in cryptography, can distribute keys between legal communication parties in an unconditionally secure manner. We consider a Phase-Matching Quantum Key Distribution protocol with 3-state systems for the first time, where the phase of the coherent state is 3.
  arXiv  Detail & Related papers  (2020-02-22T09:15:44Z)

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.