New Security Proof of a Restricted High-Dimensional QKD Protocol

• URL: http://arxiv.org/abs/2307.09560v3
• Date: Wed, 7 Feb 2024 20:54:38 GMT
• Title: New Security Proof of a Restricted High-Dimensional QKD Protocol
• Authors: Hasan Iqbal and Walter O. Krawec
• Abstract summary: High-dimensional (HD) states are known to have several interesting properties when applied to quantum cryptography. This paper revisits a particular HD-QKD protocol, which does not require Alice and Bob to be capable of sending and measuring in full mutually unbiased bases. We provide a new proof of security, and give an explicit key-rate equation for depolarization channels, allowing us to evaluate the key-rate for arbitrarily high dimensional states.
• Score: 3.58975348104054
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-dimensional (HD) states are known to have several interesting properties when applied to quantum cryptography. For quantum key distribution (QKD), these states have the potential to improve noise tolerance and efficiency. However, creating, and measuring, HD states is technologically challenging, thus making it important to study HD-QKD protocols where Alice and Bob are restricted in their quantum capabilities. In this paper, we revisit a particular HD-QKD protocol, introduced in (PRA 97 (4):042347, 2018), which does not require Alice and Bob to be capable of sending and measuring in full mutually unbiased bases. In a way, the protocol is a HD version of the three state BB84: one full basis is used for key distillation, but only a single state is used, from an alternative basis, for testing the fidelity of the channel. The previous proof of security for this protocol has relied on numerical methods, making it difficult to evaluate for high dimensions. In this work, we provide a new proof of security, and give an explicit key-rate equation for depolarization channels, allowing us to evaluate the key-rate for arbitrarily high dimensional states. Furthermore, our new proof produces better results than prior work for dimensions greater than eight, and shows that HD-states can benefit restricted protocols of this nature.

Related papers

• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• 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)
• A Secure Quantum Key Distribution Protocol Using Two-Particle Transmission [0.0]
  Unextendible Product Bases (UPBs) hold promise in quantum cryptography due to their inherent indistinguishability. This work introduces a protocol utilizing UPBs to establish quantum keys between distant parties.
  arXiv  Detail & Related papers  (2024-03-20T14:33:17Z)
• One-sided DI-QKD secure against coherent attacks over long distances [0.0]
  Device-Independent (DI) QKD protocols overcome this issue by making minimal device assumptions. We show that a one-sided DI QKD scheme with two measurements per party is secure against coherent attacks up to detection efficiencies greater than 50.1% specifically on the untrusted side. We also show that, by placing the source of states close to the untrusted side, our protocol is secure over distances comparable to standard QKD protocols.
  arXiv  Detail & Related papers  (2024-03-18T15:01:17Z)
• 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)
• Satellite-Based Quantum Key Distribution in the Presence of Bypass Channels [44.81834231082477]
  Security of quantum key distribution under restricted eavesdropping scenarios is addressed. We find regimes of operation in which the above restrictions on Eve can considerably improve system performance. Our work opens up new security frameworks for spaceborne quantum communications systems.
  arXiv  Detail & Related papers  (2022-12-09T12:24:40Z)
• Quantum key distribution based on orthogonal state encoding [0.0]
  Two quantum key distribution protocols are presented. One does not need to employ order-rearrangement techniques while the other needs to. We modify the protocols for implementing in noisy channels by applying the testing state method.
  arXiv  Detail & Related papers  (2021-07-05T12:14:05Z)
• Analysis of a High-Dimensional Extended B92 Protocol [2.335152769484957]
  Quantum key distribution allows two parties to establish a shared secret key that is secure against all-powerful adversaries. One such protocol named B92 is quite appealing due to its simplicity but is highly sensitive to channel noise. We investigate a high-dimensional variant of an extended version of the B92 protocol and show that it can distill a key over high noise channels.
  arXiv  Detail & Related papers  (2021-06-22T00:40:48Z)
• 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)
• Experimental Three-State Measurement-Device-Independent Quantum Key Distribution with Uncharacterized Sources [11.032286575112511]
  We investigate uncharacterized MDI-QKD by utilizing a three-state method. The only requirement for state preparation is that the state are prepared in a bidimensional Hilbert space. A proof-of-principle demonstration over a 170 km transmission distance is achieved.
  arXiv  Detail & Related papers  (2020-02-12T12:24:05Z)

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.