arXiv:2609.36335
Conversable Quantum Fire in the Standard Model
Ofer Casper, Barak Nehoran, Or Sattath
Abstract
Quantum fire consists of quantum states that can be efficiently functionally cloned but cannot be transmitted using one-way classical communication. Whereas all previous quantum-fire constructions with proven untelegraphability are relative to an oracle, ours, based on one-shot signatures, is in the standard model. Our construction achieves two further notions that we introduce: (a) keyless untelegraphability, a strengthening of untelegraphability; and (b) conversability, meaning that a flame, though not telegraphable via one-way classical communication, can be transmitted via classical interaction. Hence one-way and two-way classical communication differ qualitatively in their power to transmit this quantum fire. We use these two novel properties of quantum fire, along with its clonability, to give one of the first cryptographic applications of quantum fire. Keyless untelegraphability forces the distribution of serial numbers of valid flames to have high min-entropy, while conversability and clonability allow the corresponding flame to be cloned and transferred using only classical communication. We present two variants of our conversable quantum-fire construction. The first, based on one-shot signatures (instantiable from subexponential iO, subexponentially secure one-way functions, and LWE), supports polynomially many flames, and super-logarithmic min-entropy of the serial-number distribution. The second, under the stronger assumption of exponentially unforgeable one-shot signatures (instantiable relative to a classical oracle), supports exponentially many flames, and linear min-entropy.
AI Summary
Quantum fire consists of quantum states that can be functionally cloned—producing states accepted under the same serial number—but cannot be transferred by one-way classical communication. This paper asks whether such schemes can be proved secure without oracles, and whether classical interaction can nevertheless enable transfer. It constructs quantum fire from one-shot signatures using bounded-depth authenticated binary trees. A flame contains a root-to-leaf signature chain and a quantum signing token. Cloning consumes that token to authenticate two fresh child keys. Interactive transfer instead authenticates a key generated by the receiver, whose quantum token remains local. The construction satisfies keyless untelegraphability, allowing the adversary to choose the serial number. Security follows by repeatedly running a purported classical reconstruction procedure: sufficiently many reconstructed chains yield either inconsistent signatures or repeated signing tokens, violating one-shot unforgeability. Ordinary one-shot unforgeability supports depth $c\log\lambda$ for any fixed $c$, hence polynomially many flames. Known instantiations require subexponential iO and one-way functions, plus LWE. Exponential unforgeability supports depth $\lambda/8$ and exponentially many flames; a stronger quantitative assumption yields at least $\lambda/8$ serial-number min-entropy. Keyless untelegraphability implies super-logarithmic serial-number min-entropy. Combined with interactive transfer, this gives publicly certifiable min-entropy with quantum verifiers and bounded sequential transferability over classical channels. Classically generable verification keys permit classical verification, but lose transferability. Sequential cloning depth remains bounded, and exponentially secure one-shot signatures are currently instantiated only relative to an oracle. The guarantees concern min-entropy, not uniform randomness; entropy accumulation is left open.
We used Claude (Anthropic) and ChatGPT (OpenAI) only to assist with proofreading, routine editorial work, guidance on the literature review, and the generation of illustrations.
Error found: The security reductions as written may return an invalid forgery from an unsuccessful reconstruction before reaching the useful samples, so their repetition argument needs an explicit verified-signature selection procedure.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 40 pages, 9 figures