Composable, unconditional security without a Quantum secret key: public broadcast channels and their conceptualizations, adaptive bit transmission rates, fidelity pruning under wiretaps

• URL: http://arxiv.org/abs/2512.19759v1
• Date: Fri, 19 Dec 2025 22:18:39 GMT
• Title: Composable, unconditional security without a Quantum secret key: public broadcast channels and their conceptualizations, adaptive bit transmission rates, fidelity pruning under wiretaps
• Authors: Pete Rigas,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We examine public broadcast, forward conceptual, and backward conceptual, Quantum channels in the context of communication protocols that are independent of secret keys. Given research directions of interest previously identified in arXiv: 1804.01797, besides converse upper bounds on the bit transmission rate obtained by the author in recent work (arXiv: 2507.03035), additional possibilities remain, including: (1) determining whether aspects of QKD dependent protocols can be incorporated into steps of QKD independent protocols; (2) whether there would be any amplification to the Quantum-classical performance gap that Alice and Bob can exploit towards prospective Quantum advantage; (3) formulating the conditions under which secrecy and authentication can be simultaneously achieved. To characterize the conditions for which secrecy can be achieved with high probability, 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, but also that forward conceptual channels, through cascading, can significantly increase Eve's probability of false acceptance. Albeit the fact that secrecy, along with conceputalizations of the public broadcast channel, were initially discussed by Maurer for QKD dependent protocols, determining whether aspects of such protocols can be adapted for unconditional security without the use of a secret key is of great interest to explore. We demonstrate that Eve's error probability, through the cascading procedure, can be analyzed with the Holevo information under an optimal decoder. Furthermore, through post-processing of the outputs of a Completely Positive Trace Preserving (CPTP) map, we also demonstrate how to decrease Holevo sum quantities with data-processing and entropy-continuity bounds.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography [0.38233569758620045]
  Quantum key distribution (QKD) information-theoretic security, without relying on computational assumptions, by distributing quantum states.<n>In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing.<n>Our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.
  arXiv  Detail & Related papers  (2026-02-05T16:48:03Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Quantum Internet in a Nutshell -- Advancing Quantum Communication with Ion Traps [25.519081784735068]
  We study the incorporation of small quantum error correction codes into quantum communication protocols.<n>We find that these codes can help to suppress the noise level and to monitor the noise profile of the channel.
  arXiv  Detail & Related papers  (2025-07-18T22:07:54Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Increasing Interference Detection in Quantum Cryptography using the Quantum Fourier Transform [0.0]
  We present two quantum cryptographic protocols leveraging the quantum Fourier transform (QFT) The foremost of these protocols is a novel QKD method that leverages this effectiveness of the QFT. We additionally show how existing quantum encryption methods can be augmented with a QFT-based approach to improve eavesdropping detection.
  arXiv  Detail & Related papers  (2024-04-18T21:04:03Z)
• 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)
• The Quantum Cryptography Approach: Unleashing the Potential of Quantum Key Reconciliation Protocol for Secure Communication [7.318072482453136]
  Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This paper proposes a novel method that allows users to communicate while generating the secure keys and securing the transmission without any leakage of the data.
  arXiv  Detail & Related papers  (2024-01-17T05:41:17Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing.<n>We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Dimensional advantage in secure information trading via the noisy dense coding protocol [0.0]
  We present the DC-based QKD protocol for higher dimensional systems. We report the lower bounds on secret key rate, when the shared state is a two-qudit maximally entangled state. We prove that the set of useless states in the DC-based QKD protocol is convex and compact.
  arXiv  Detail & Related papers  (2023-10-31T17:50:48Z)
• 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)
• 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)
• 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)

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.