Noise-limited secret key agreement with twin optical physically unclonable functions

• URL: http://arxiv.org/abs/2607.04936v1
• Date: Mon, 06 Jul 2026 11:07:30 GMT
• Title: Noise-limited secret key agreement with twin optical physically unclonable functions
• Abstract summary: We use twin optical fingerprints as a hardware-based platform for cryptographic key generation and distribution.<n>We study the conditions under which two honest parties can establish a common secret key, despite fabrication-induced variability and environmental noise.<n>We discuss how twin optical PUFs could be integrated into quantum key distribution networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the use of twin optical fingerprints derived from correlated physical unclonable functions (PUFs), as a hardware-based platform for cryptographic key generation and distribution. Each fingerprint is associated with a random, yet reproducible speckle pattern, generated when coherent light is scattered by a disordered optical structure. We consider a pair of correlated optical PUFs, and study the conditions under which two honest parties can establish a common secret key, despite fabrication-induced variability and environmental noise. An explicit information-theoretic key-agreement protocol is developed, incorporating secure sketches, error reconciliation, and privacy amplification. We quantify information leakage due to public helper data, and derive lower bounds on the length of the final secret key. The analysis identifies the noise regimes in which secure key agreement is feasible, and examines the performance of both practical and near-capacity reconciliation schemes. Finally, we discuss how twin optical PUFs could be integrated into quantum key distribution (QKD) networks, as a mechanism for establishing an initial pre-shared secret key between two honest users, without relying on computational assumptions or trusted third parties.

Related papers

• Malleability of transformations on the ciphertext in noisy Quantum public key encryption [0.0]
  We characterize a noisy variant of a Quantum public encryption protocol recently introduced by Malavolta and Walter.<n>We show how upper bounds on the trace distance can be used to generalize the negligibility function obtained by Malavolta and Walter in the noiseless setting.
  arXiv  Detail & Related papers  (2026-07-27T05:48:15Z)
• The Capacity of Information-Theoretic Secure Aggregation in Federated Learning [38.64656884737012]
  We study the $T$-colluding information-theoretic secure aggregation problem with $N$ users.<n>Unlike prior work, we model key distribution through user-to-user communication.<n>We show that the optimal performance can be achieved using only pairwise shared keys.
  arXiv  Detail & Related papers  (2026-06-05T13:53:27Z)
• Security of Binary-Modulated Optical Key Distribution Against Quantum-Enhanced Coherent Eavesdropping [0.956920837336479]
  Optical key distribution (OKD) protects the physical layer of communication links by taking advantage of the inherent noise present in the photodetection process.<n>We present a comprehensive security analysis against more powerful eavesdroppers possessing either the ability to perform coherent detection, or even quantum-optimal measurements on the intercepted transmission.
  arXiv  Detail & Related papers  (2026-03-20T18:15:22Z)
• Towards Device-Independent Quantum Key Distribution with Photonic Devices [0.0]
  Device-Independent (DI) QKD addresses the problem by reducing the degree of device modeling to a black-box setting.<n>In this work, we assess the feasibility of DIQKD on a photonic circuit recently identified by machine learning techniques.<n>Our analysis shows that the proposed optical circuit is sufficiently resistant to noise to make an experimental realization realistic.
  arXiv  Detail & Related papers  (2026-01-20T19:00:03Z)
• Plugging Leaks in Fault-Tolerant Quantum Computation and Verification [0.03499870393443268]
  We present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-dependent noise on the verifier's quantum device.<n>Our main tools are two novel distillation protocols that turn secret-dependent noise into secret-independent noise.<n>We use these protocols to prepare states in the X-Y-plane whose noise is overwhelmingly secret-independent, which then allows us to verify with exponential confidence arbitrary fault-tolerant BQP computations.
  arXiv  Detail & Related papers  (2025-10-03T17:57:59Z)
• Twin-field-based multi-party quantum key agreement [0.0]
  We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement.<n>We study our protocol's security using a minimum error discrimination analysis and derive the key rate based on the entanglement-based source-replacement scheme.
  arXiv  Detail & Related papers  (2024-09-06T11:51:10Z)
• Eavesdropper localization for quantum and classical channels via nonlinear scattering [58.720142291102135]
  Quantum key distribution (QKD) offers theoretical security based on the laws of physics. We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels. We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
  arXiv  Detail & Related papers  (2023-06-25T21:06:27Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Experimental quantum key distribution certified by Bell's theorem [0.0]
  cryptographic key exchange protocols traditionally rely on computational conjectures to provide security against eavesdropping attacks. quantum key distribution protocols provide information-theoretic security against such attacks. However, quantum protocols are subject to a new class of attacks exploiting implementation defects in the physical devices involved. We present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities.
  arXiv  Detail & Related papers  (2021-09-29T17:52:48Z)
• 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)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

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.