Malleability of transformations on the ciphertext in noisy Quantum public key encryption

• URL: http://arxiv.org/abs/2607.26086v1
• Date: Mon, 27 Jul 2026 05:48:15 GMT
• Title: Malleability of transformations on the ciphertext in noisy Quantum public key encryption
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We characterize a noisy variant of a Quantum public encryption protocol recently introduced by Malavolta and Walter which demonstrated that the notion of everlasting security can be rigorously formulated for Quantum key distribution after two rounds of interaction between Alice and Bob. To address one possible direction of research that is related to injecting noise in the cryptographic protocol related to Quantum key distribution we formulate arguments for further examining the notion of everlasting security through malleability assumptions on transformations of the ciphertext. Assumptions surrounding malleability were introduced by Maurer and Tackmann for the purposes of comparing how authenticate then encrypt, and encrypt then authenticate, protocols behave through a variety of expressions for the forwarding error, deleting error, and reconstruction probabilities. Such probabilities are put to further use for obtaining connections between the indistinguishability and security threshold for a cryptographic protocol of interests. To further build upon such associations we demonstrate, through an adaptation of the Gentle Measurement Lemma from Quantum information theory, how upper bounds on the trace distance can be used to generalize the negligibility function obtained by Malavolta and Walter in the noiseless setting. Besides the fact that the negligibility function in the noisy setting is related to a higher security threshold it continues to remain of interest to determine whether computations provided in this work for upper bounding the trace distance can be related to other settings that are centered more on game-theoretic approaches.

Related papers

• Quaternary-Squeeze Quantum Identity Authentication: Direction-Scaling Security via Single-Mode Squeezed Light [4.87244033582479]
  Quantum identity authentication (QIA) has emerged as a crucial technology for secure communication systems.<n>This paper proposes a novel QIA protocol based on non-classical characteristics of squeezed light fields.
  arXiv  Detail & Related papers  (2026-07-10T07:31:27Z)
• 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)
• Enhanced Rényi Entropy-Based Post-Quantum Key Agreement with Provable Security and Information-Theoretic Guarantees [0.0]
  This paper presents an enhanced post-quantum key agreement protocol based on R'enyi entropy, addressing vulnerabilities in the original construction while preserving information-theoretic security properties.<n>We develop a theoretical framework leveraging entropy-preserving operations and secret-shared verification to achieve provable amplification against quantum adversaries.<n>Key innovations include a confidentiality-preserving verification mechanism using distributed oracle commitments, tightened min-entropy bounds with guaranteed non-negativity, and composable security proofs in the quantum universal composability framework.
  arXiv  Detail & Related papers  (2025-08-28T00:42:49Z)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• 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)
• Demonstration of Entanglement-Enhanced Covert Sensing [3.516093069612194]
  We present the theory and experiment for entanglement-enhanced covert sensing. We show that entanglement offers a performance boost in estimating the imparted phase by a probed object. Our work is expected to create ample opportunities for quantum information processing at unprecedented security and performance levels.
  arXiv  Detail & Related papers  (2022-05-25T16:20:34Z)
• 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)
• 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)
• 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)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• Homodyne Detection Quadrature Phase Shift Keying Continuous-Variable Quantum Key Distribution with High Excess Noise Tolerance [7.87972015113057]
  We propose a homodyne detection protocol using the quadrature phase shift keying technique. By limiting information leakage, our proposed protocol enhances excess noise tolerance to a high level. Our results imply that the current protocol is able to distribute keys in nearly intercity area.
  arXiv  Detail & Related papers  (2021-04-22T16:10:35Z)
• 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)

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.