randextract: a Reference Library to Test and Validate Privacy Amplification Implementations

• URL: http://arxiv.org/abs/2506.00124v1
• Date: Fri, 30 May 2025 18:01:50 GMT
• Title: randextract: a Reference Library to Test and Validate Privacy Amplification Implementations
• Authors: Iyán Méndez Veiga, Esther Hänggi,
• Abstract summary: The secrecy of any quantum key distribution protocol critically depends on the correct execution of the privacy amplification step.<n>We present randextract, a reference library to test and validate privacy amplification implementations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum cryptographic protocols do not rely only on quantum-physical resources, they also require reliable classical communication and computation. In particular, the secrecy of any quantum key distribution protocol critically depends on the correct execution of the privacy amplification step. This is a classical post-processing procedure transforming a partially secret bit string, known to be somewhat correlated with an adversary, into a shorter bit string that is close to uniform and independent of the adversary's knowledge. It is typically implemented using randomness extractors. Standardization efforts in quantum cryptography have focused on the security of physical devices and quantum operations. Future efforts should also consider all algorithms used in classical post-processing, especially in privacy amplification, due to its critical role in ensuring the final security of the key. We present randextract, a reference library to test and validate privacy amplification implementations.

Related papers

• Authenticated Sublinear Quantum Private Information Retrieval [12.91566002502802]
  This paper introduces a novel lower bound on communication complexity using quantum relative entropy and mutual information.<n>By leveraging Uhlmann's lemma and quantum Pinsker inequalities, the authors establish tighter bounds for information-theoretic security.
  arXiv  Detail & Related papers  (2025-04-05T03:30:04Z)
• Quantum Scheme for Private Set Intersection and Union Cardinality based on Quantum Homomorphic Encryption [8.715631190576067]
  A novel quantum private set intersection and union cardinality protocol is proposed, accompanied by the corresponding quantum circuits.<n>Based on quantum homomorphic encryption, the protocol allows the intersection and union cardinality of users' private sets to be computed on quantum-encrypted data.
  arXiv  Detail & Related papers  (2024-12-02T01:31:06Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Seedless extractors for device-independent quantum cryptography [0.0]
  Device-independent (DI) quantum cryptography aims at providing secure cryptography with minimal trust in, or characterisation of, the underlying quantum devices.<n>Key step in DI protocols is randomness extraction (or privacy amplification)<n>We propose a method for extraction in DI protocols that does not require a seed and is secure against computationally quantum adversaries.
  arXiv  Detail & Related papers  (2024-03-07T18:07:52Z)
• Secure Key from Quantum Discord [22.97866257572447]
  We show how to make use of discord to analyze security in a specific quantum cryptography protocol. Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
  arXiv  Detail & Related papers  (2023-04-12T14:21:49Z)
• 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)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Privacy amplification scheme based on composite coding [2.9848983009488936]
  We propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. The information-theoretic bound for the extraction of the key is obvious in composite coding.
  arXiv  Detail & Related papers  (2021-09-15T07:58:09Z)
• 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)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.