Towards the Impossibility of Imperfectly Complete Key Agreement in the QROM

• URL: http://arxiv.org/abs/2608.17610v1
• Date: Tue, 18 Aug 2026 10:19:27 GMT
• Title: Towards the Impossibility of Imperfectly Complete Key Agreement in the QROM
• Abstract summary: We make progress towards the impossibility of imperfectly complete quantum-computation, classical-communication (QCCC) key agreement.<n>We construct the first unconditional attacks on quantum key agreement in the following restricted settings.
• Score: 9.538313445597385
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We make progress towards the impossibility of imperfectly complete quantum-computation, classical-communication (QCCC) key agreement by constructing the first unconditional attacks on quantum key agreement in the following restricted settings. In the two-message setting, we assume that Alice makes only classical queries to the oracle in the first round and that her message to Bob is classical, but otherwise both parties may perform arbitrary quantum computation, make quantum queries, and send a quantum state in the second round. Our attack and analysis are based on the heavy-query learning techniques from Austrin et al. (CRYPTO 2022) and the reprogramming techniques of Katz and Sela (arXiv 2401.14319). In the round-independent setting, we show that the attack of Barak and Mahmoody (CRYPTO 2009; J. Cryptology 2017) can be extended to multiple rounds when Alice and Bob share classical communication and make only classical queries in all but the final round. In both settings, the attacker is computationally unbounded and makes $poly(λ)$ queries to recover the key whenever each honest query bound is at most $poly(λ)$ and the valid agreement probability is inverse-polynomial. As a consequence, we rule out imperfectly correct quantum public-key encryption for classical messages whose length is bounded by a polynomial in $λ$ in the QROM when key generation has classical oracle access, even if encryption, decryption, and the ciphertext are quantum. In particular, the one-bit case applies to the imperfectly correct PKE obtained from two-round OSP by Bartusek and Khurana (CRYPTO 2025) whenever the classical OSP sender makes only classical random-oracle queries.

Related papers

• EFI Pairs Without One-Way Puzzles: Oracle Separations from Communication Complexity [0.0]
  One-way puzzles imply EFI pairs, and whether holds is open.<n>We construct a single classical oracle relative to which one-way puzzles do not exist, even with an unbounded verifier.<n>An EFI pair survives every distinguisher that queries the oracle classically throughout and holds advice about it, making its one superposition query at the end.
  arXiv  Detail & Related papers  (2026-09-10T17:54:55Z)
• Impossibility of Perfectly Complete Many-Round Key Agreement in the QROM [7.423478193398542]
  It is impossible to construct perfectly complete quantum key agreement protocols (QKA) from quantumly secure one-way functions (OWFs) in a black-box manner.<n>This paper shows that there exists an eavesdropper, given the classical messages, that can recover the shared key with certainty using $O((q_mathsfA+q_mathsfB)5)$ classical oracle queries.
  arXiv  Detail & Related papers  (2026-08-04T15:33:42Z)
• Cryptomania v.s. Minicrypt in a Quantum World [5.885896375772235]
  We prove that it is impossible to construct perfect-complete quantum public-key encryption (QPKE) with classical keys from quantumly secure one-way functions (OWFs) in a black-box manner.
  arXiv  Detail & Related papers  (2025-04-08T06:07:40Z)
• On the Power of Oblivious State Preparation [14.520515990983897]
  Oblivious State Preparation (OSP) is a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client. Results help to ''explain'' the use of public-key cryptography in approaches to establishing a ''classical leash'' on a quantum server.
  arXiv  Detail & Related papers  (2024-11-06T19:58:53Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions [0.5999777817331317]
  It has been recently shown that public-key encryption (PKE) from one-way functions (OWF) is possible if we consider quantum public keys. In this paper, we focus on black-box separation for PKE with classical public key and quantum ciphertext from OWF.
  arXiv  Detail & Related papers  (2023-11-06T20:41:25Z)
• Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution [16.06159998475861]
  Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. It has two main advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels. We propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions.
  arXiv  Detail & Related papers  (2023-04-06T11:14:55Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• 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 Depth in the Random Oracle Model [57.663890114335736]
  We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
  arXiv  Detail & Related papers  (2022-10-12T17:54:02Z)
• Oracle separations of hybrid quantum-classical circuits [68.96380145211093]
  Two models of quantum computation: CQ_d and QC_d. CQ_d captures the scenario of a d-depth quantum computer many times; QC_d is more analogous to measurement-based quantum computation. We show that, despite the similarities between CQ_d and QC_d, the two models are intrinsically, i.e. CQ_d $nsubseteq$ QC_d and QC_d $nsubseteq$ CQ_d relative to an oracle.
  arXiv  Detail & Related papers  (2022-01-06T03:10:53Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• 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)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

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.