Revocable Cryptography via Quantum States

16 concepts7 papers1 proposal

In classical cryptography, information is inherently permanent. If you delegate a decryption key or a piece of sensitive data to a remote server, you lose absolute control over it. The recipient can duplicate the digital key an infinite number of times, meaning you can never truly "take it back" or verify that it has been deleted.

Quantum mechanics fundamentally changes this paradigm through the no-cloning theorem, which states that it is impossible to create an identical copy of an arbitrary, unknown quantum state. By representing cryptographic keys and credentials as quantum states rather than classical bitstrings, we can build systems where access can be explicitly revoked.

The Mechanism of Certified Deletion

To understand why revocable quantum cryptography works, consider the challenge of proving a negative: how can a user prove to a data owner that they have deleted a key?

If the key is a classical string, any "proof" of deletion can be faked by a user who simply kept a copy. However, if the key is encoded as a specific quantum state, the data owner can demand a cryptographic certificate of destruction.

Classical Key:  [01101]  --> Can be copied infinitely before deletion.
Quantum Key:    |ψ⟩      --> Cannot be copied. Measuring it to prove 
                             deletion destroys the key itself.

As introduced by Ananth et al. in Revocable Cryptography from Learning with Errors, a quantum secret key can be designed such that a user must perform a specific, destructive measurement on the state to generate a classical bitstring—the "certificate of deletion." Because of the complementary nature of quantum measurements (akin to the uncertainty principle), performing the measurement required to generate this certificate fundamentally collapses and destroys the key's ability to decrypt data. If the user returns a valid classical certificate, the no-cloning theorem guarantees they could not have kept a functional copy of the quantum key.

This principle is highly effective for securing delegated computations. For instance, in remote state preparation, a client might give a server classical keys to construct a quantum state. If the server retains this information, they can manipulate future steps of the computation. To prevent this, Jiayu Zhang in Classical Verification of Quantum Computations in Linear Time utilizes specialized verification gadgets. By forcing the server to undergo a verification process (such as a Hadamard test), the server mathematically proves they have discarded the state-preparation keys, neutralizing the risk of subsequent exploitation.

Enforcing Single-User Constraints

Beyond active revocation, quantum states can inherently enforce constraints on how many entities can use a piece of data simultaneously.

Ananth et al. leverage this in Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography by implementing decryption keys as quantum states in superposition. Because measuring or interacting with the quantum key to decrypt a ciphertext alters or consumes information that cannot be replicated without disturbing the state, it enforces a strict single-decryptor constraint. Two independent attackers cannot coordinate to decrypt a ciphertext using a single quantum key state, as any attempt to split or clone the key results in useless noise.

A parallel mechanism applies to secure commitments. In a classical commitment scheme, a user locks a message in a digital box and reveals it later. In the quantum setting, Gunn et al. in Commitments to Quantum States formalize a security property called swap binding. When a sender commits to a quantum state and sends the commitment register, the protocol ensures that the sender's remaining view of the state becomes completely indistinguishable from a fixed "junk" state. The act of committing effectively erases the information from the sender's possession, preventing them from modifying the state later.

The Multi-Copy Vulnerability

While the no-cloning theorem protects a single quantum state, a critical vulnerability arises if an adversary obtains multiple identical copies of that state.

With a single copy of a quantum state, you cannot determine what it is without destroying it. However, if you possess many identical copies, you can perform quantum state tomography—a process of measuring different copies along different axes to statistically reconstruct a complete classical description of the state. Once the adversary has the classical description, they can clone it infinitely, breaking the revocation property entirely.

1 Copy of |ψ⟩   --> Tomography impossible. No-cloning holds.
Many Copies of |ψ⟩ --> Tomography possible. State can be reconstructed classically.

To counter this, cryptographic primitives must be engineered to be secure against multi-copy attacks. Ananth et al. address this vulnerability in Pseudorandom Isometries, designing public-key encryption schemes for quantum states that maintain security even when an adversary intercepts and analyzes multiple copies of the same ciphertext.

Building on this, Ananth et al. demonstrate in Revocable Encryption, Programs, and More: The Case of Multi-Copy Security that it is possible to construct revocable primitives that resist tomography. Even if a malicious user accumulates multiple identical copies of a quantum key or program, the underlying algebraic structure prevents them from extracting the classical information required to bypass revocation.

Grounding in Standard Assumptions

Early theoretical models of quantum revocation relied on idealized assumptions, such as the random oracle model, which assumes access to a perfectly random mathematical function. To make these primitives viable for real-world post-quantum security, they must be built on standard, well-studied computational hardness assumptions.

The field achieved this milestone by anchoring quantum revocation within lattice-based cryptography—specifically, the Learning with Errors (LWE) problem, which is believed to be secure against both classical and quantum computers. Ananth et al. in Quantum Key-Revocable Dual-Regev Encryption, Revisited proved the security of key-revocable public-key encryption, fully homomorphic encryption, and pseudorandom functions under the polynomial hardness of LWE.

By combining the physical laws of quantum mechanics (ensuring unclonability) with the mathematical hardness of lattice problems (ensuring computational security), revocable cryptography provides a provably secure framework for temporary, verifiable access control in the quantum era.

Key Foundational Work

Revocable Cryptography from Learning with Errors (2023) — contributed 4 concept elements to this direction.
Classical Verification of Quantum Computations in Linear Time (2022) — contributed 3 concept elements to this direction.
Pseudorandom Isometries (2023) — contributed 2 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_quantum_state_revocation_5ea817b7,
  title = {quantum state revocation},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/quantum-state-revocation/rdr_5ea817b78a92474aaea572596ec0801c},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_quantum_state_revocation_5ea817b7_v1,
  title = {quantum state revocation},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/quantum-state-revocation/rdr_5ea817b78a92474aaea572596ec0801c/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake