Unclonable Cryptography in Linear Quantum Memory

• URL: http://arxiv.org/abs/2511.04633v1
• Date: Thu, 06 Nov 2025 18:30:28 GMT
• Title: Unclonable Cryptography in Linear Quantum Memory
• Authors: Omri Shmueli, Mark Zhandry,
• Abstract summary: In cryptography, quantum states are used as long-term cryptographic keys.<n>It will be important to minimize persistent memory in quantum protocols.<n>We develop novel techniques for proving the security of cryptosystems using coset states.
• Score: 10.502761612692929
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum cryptography is a rapidly-developing area which leverages quantum information to accomplish classically-impossible tasks. In many of these protocols, quantum states are used as long-term cryptographic keys. Typically, this is to ensure the keys cannot be copied by an adversary, owing to the quantum no-cloning theorem. Unfortunately, due to quantum state's tendency to decohere, persistent quantum memory will likely be one of the most challenging resources for quantum computers. As such, it will be important to minimize persistent memory in quantum protocols. In this work, we consider the case of one-shot signatures (OSS), and more general quantum signing tokens. These are important unclonable primitives, where quantum signing keys allow for signing a single message but not two. Naturally, these quantum signing keys would require storage in long-term quantum memory. Very recently, the first OSS was constructed in a classical oracle model and also in the standard model, but we observe that the quantum memory required for these protocols is quite large. In this work, we significantly decrease the quantum secret key size, in some cases achieving asymptotically optimal size. To do so, we develop novel techniques for proving the security of cryptosystems using coset states, which are one of the main tools used in unclonable cryptography.

Related papers

• Practical quantum tokens: challenges and perspectives [49.583101345036624]
  The concept of quantum tokens dates back alongside quantum cryptography to Stephen Wiesner's seminal work in 1983.<n>We discuss the current state-of-the-art of quantum tokens in the field of quantum information, as well as their future perspectives.
  arXiv  Detail & Related papers  (2026-02-11T08:11:36Z)
• Quantum Public Key Encryption for NISQ Devices [6.773399736037789]
  Quantum public-key encryption (PKE) is an important primitive in quantum cryptography.<n>We design a PKE scheme with quantum-classical public keys and classical ciphertexts, that is noise-resilient and only requires a small number of qubits acting coherently.
  arXiv  Detail & Related papers  (2025-09-22T13:20:26Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Hard Quantum Extrapolations in Quantum Cryptography [9.214658764451348]
  We study the quantum analogues of the universal extrapolation task.<n>We show that it is hard if quantum commitments exist, and it is easy for quantum space.
  arXiv  Detail & Related papers  (2024-09-25T00:09:42Z)
• Commitments from Quantum One-Wayness [0.0]
  This work studies one-way state generators, a natural quantum relaxation of one-way functions. A fundamental question is whether this type of quantum one-wayness suffices to realize quantum cryptography. We prove that one-way state generators with pure state outputs imply quantum bit commitments and secure multiparty computation.
  arXiv  Detail & Related papers  (2023-10-17T18:48:22Z)
• 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 oblivious transfer: a short review [0.06554326244334865]
  We study the concept of oblivious transfer in the area of theoretical quantum cryptography. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.
  arXiv  Detail & Related papers  (2022-06-06T15:19:26Z)
• 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)
• A practical quantum encryption protocol with varying encryption configurations [0.0]
  We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states. The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
  arXiv  Detail & Related papers  (2021-01-22T20:09:03Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.