Quantum key distribution with post-processing driven by physical unclonable functions

• URL: http://arxiv.org/abs/2302.07623v1
• Date: Wed, 15 Feb 2023 12:33:01 GMT
• Title: Quantum key distribution with post-processing driven by physical unclonable functions
• Authors: Georgios M. Nikolopoulos and Marc Fischlin
• Abstract summary: Quantum key-distribution protocols allow two honest distant parties to establish a common truly random secret key in the presence of powerful adversaries. This pre-shared secret key is used mainly for authentication purposes in the post-processing of classical data. We discuss the conditions under which physical unclonable function can be integrated in currently available quantum key-distribution systems.
• Score: 2.233624388203003
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum key-distribution protocols allow two honest distant parties to establish a common truly random secret key in the presence of powerful adversaries, provided that the two users share beforehand a short secret key. This pre-shared secret key is used mainly for authentication purposes in the post-processing of classical data that have been obtained during the quantum communication stage, and it prevents a man-in-the-middle attack. The necessity of a pre-shared key is usually considered as the main drawback of quantum key-distribution protocols, which becomes even stronger for large networks involving more that two users. Here we discuss the conditions under which physical unclonable function can be integrated in currently available quantum key-distribution systems, in order to facilitate the generation and the distribution of the necessary pre-shared key, with the smallest possible cost in the security of the systems. Moreover, the integration of physical unclonable functions in quantum key-distribution networks allows for real-time authentication of the devices that are connected to the network.

Related papers

• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• Unconditionally secure key distribution without quantum channel [0.76146285961466]
  Currently, the quantum scheme stands as the only known method for achieving unconditionally secure key distribution. We propose another key distribution scheme with unconditional security, named probability key distribution, that promises users between any two distances to generate a fixed and high secret key rate. Non-local entangled states can be generated, identified and measured in the equivalent virtual protocol and can be used to extract secret keys.
  arXiv  Detail & Related papers  (2024-08-24T15:13:14Z)
• Simulations of distributed-phase-reference quantum key distribution protocols [0.1398098625978622]
  Quantum key distribution protocols provide a secret key between two users with security guaranteed by the laws of quantum mechanics. We perform simulations on the Interconnect platform to characterise the practical implementation of these devices. We briefly describe and simulate some possible eavesdropping attempts, backflash attack, trojan-horse attack and detector-blinding attack exploiting the device imperfections.
  arXiv  Detail & Related papers  (2024-06-13T13:19:04Z)
• Guarantees on the structure of experimental quantum networks [109.08741987555818]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• Establishing shared secret keys on quantum line networks: protocol and security [0.0]
  We show the security of multi-user key establishment on a single line of quantum communication. We consider a quantum communication architecture where qubit generation and measurement happen at the two ends of the line.
  arXiv  Detail & Related papers  (2023-04-04T15:35:23Z)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• Scalable authentication and optimal flooding in a quantum network [2.604279577944016]
  We consider two related protocols, their experimental demonstrations on an 8-user quantum network test-bed. First, an authentication transfer protocol to manage a fundamental limitation of quantum communication. Second, when end users quantify their trust in intermediary nodes, our flooding protocol can be used to improve both end-to-end communication speeds and increase security against malicious nodes.
  arXiv  Detail & Related papers  (2021-01-28T19:00:07Z)
• The QQUIC Transport Protocol: Quantum assisted UDP Internet Connections [11.223026257748657]
  Quantum key distribution, in 1984, is a commercialized secure communication method which enables two parties to produce shared random secret key by the nature of quantum mechanics. We propose QQUIC (Quantum assisted Quick Internet Connections) transport protocol, which modifies the famous QUIC transport protocol by employing the quantum key distribution instead of the original classical algorithms in the key exchanging stage.
  arXiv  Detail & Related papers  (2020-06-01T00:44:58Z)
• Experimental quantum conference key agreement [55.41644538483948]
  Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement. We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
  arXiv  Detail & Related papers  (2020-02-04T19:00: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.