Eve's forgery probability from her false acceptance probability: interactive authentication, Holevo information and the min-entropy

• URL: http://arxiv.org/abs/2603.06645v1
• Date: Thu, 26 Feb 2026 21:41:28 GMT
• Title: Eve's forgery probability from her false acceptance probability: interactive authentication, Holevo information and the min-entropy
• Abstract summary: We show that protocols over noisy Quantum channels are dependent upon a single, unified security threshold.<n>We obtain the desired security threshold by bounding the false acceptance probability with a suitably chosen two-universal function.<n>As a result the protocol is not only $$-secure, for some $>0$, but also composable against forgery and key leakage.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We obtain estimates for Eve's forgery probability, namely the probability that she is able to forge a message which Alice or Bob mistakenly accept over a noisy Quantum channel for generating a shared Quantum secret key. This probability is related to Eve's success probability obtained in a previous work due to Renner and Wolf, which was obtained from assumptions on the min-entropy for characterizing asymmetric security. To demonstrate that protocols over noisy Quantum channels are dependent upon a single, unified security threshold in comparison to multiple security parameters in the Renner-Wolf interactive authentication protocol framework we upper bound Eve's forgery probability with a Holevo-type quantity that can be made negligibly small. By leveraging estimates for Eve's false acceptance probability that have previously been obtained by the author, we obtain the desired security threshold by bounding the false acceptance probability with a suitably chosen two-universal function which serves as a counterpart to two-universal hashing functions that have previously been examined for cryptographic protocols in Quantum key distribution. As a result the protocol is not only $ε$-secure, for some $ε>0$, but also composable against forgery and key leakage.

Related papers

• How to Verify Consistency of Probabilistic Claims [49.47758039235095]
  We construct an interactive PCP to prove a predictive model's consistency.<n>We show how a small additive-soundness gap removes dependence on B.<n>We view our interactive PCP as a first step toward predictive models to prove their own consistency.
  arXiv  Detail & Related papers  (2026-08-11T17:41:39Z)
• 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)
• Composable, unconditional security without a Quantum secret key: public broadcast channels and their conceptualizations, adaptive bit transmission rates, fidelity pruning under wiretaps [0.0]
  We examine Quantum channels in the context of communication protocols that are independent of secret keys.<n>We argue that there not only exists suitable protocols which enable Alice and Bob to map into the authenticated space of bit codewords with high probability.<n>We demonstrate that Eve's error probability, through the cascading procedure, can be analyzed with the Holevo information under an optimal decoder.
  arXiv  Detail & Related papers  (2025-12-19T22:18:39Z)
• Variational Secret Common Randomness Extraction [38.319927578257726]
  We study the problem of extracting common randomness (CR) or secret keys from correlated random sources observed by two legitimate parties, Alice and Bob, through public discussion in the presence of an eavesdropper, Eve.<n>We propose a practical two-stage CR extraction framework. In the first stage, Alice and Bob employ probabilistic neural network (NN) encoders to map their observations into discrete, nearly uniform random variables (RVs) with high agreement probability.<n>In the second stage, a secure sketch using code-offset construction reconciles the encoder outputs into identical secret keys, whose secrecy is guaranteed by the VPQ objective
  arXiv  Detail & Related papers  (2025-10-02T14:22:21Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Quantum Key Distribution using Expectation Values of Super-classical GHZ States [0.0]
  We propose a new quantum key distribution scheme that is based on the optimum expectation values of maximally entangled Greenberger-Horne-Zeilinger states. Our protocol makes use of the degrees of freedom in continuously variable angles, thereby increasing the security of the key distribution.
  arXiv  Detail & Related papers  (2023-08-17T21:40:21Z)
• Security of One-Way Entanglement Purification with Quantum Sampling Against a Restricted Adversary [0.0]
  Entanglement purification protocols promise to play a critical role in the future of quantum networks by distributing entanglement across noisy channels. We propose a one-way entanglement purification protocol which utilizes quantum sampling and prove its security against an adversary restricted to single qubit Pauli gates.
  arXiv  Detail & Related papers  (2023-06-18T02:29:21Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• The Trivial Bound of Entropic Uncertainty Relations [0.0]
  Entropic uncertainty relations are underpinning to compute the quantitative security bound in quantum cryptographic applications. This paper draws one case of the POVM-versioned standard entropic uncertainty relation yielding the trivial bound.
  arXiv  Detail & Related papers  (2022-07-30T15:01:40Z)
• 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)
• A simple relation of guessing probability in quantum key distribution [0.45687771576879593]
  The receiver-eavesdropper similarity implies a simple relation in terms of guessing probability and correctness of sifted keys. The regions of error rates determined by such a guessing-probability-based relation are shown to be close to those determined by security criteria.
  arXiv  Detail & Related papers  (2021-12-22T10:41:39Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55: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.