Paper 2026/1511
Unconditional Unclonable Encryption
Abstract
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Previous work by Bhattacharyya and Culf (Nature Physics, 2026) and Bhattacharyya, Broadbent, and Culf (arXiv:2603.08916) either only showed inverse-polynomial security loss or required inefficient encryption/decryption operations; we avoid both of these caveats. Our scheme's key is a uniformly random non-identity phase-free Pauli on $n$ qubits, and bit $a$ is encrypted as a random $(-1)^a$ eigenstate of that Pauli. We prove that the probability that both receivers recover the bit is at most $1/2 + O\left(2^{-n/2}\right).$ By a lower bound due to Broadbent, Culf, and Rochette (IACR Communications in Cryptology, 2026), this is the best probability bound achievable with $n$-qubit ciphertexts while ensuring perfect correctness (up to the constant hidden in the $O(\cdot)$).
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Quantum CryptographyUnclonable Cryptography
- Contact author(s)
-
prabhanjan va @ gmail com
sragavan @ mit edu
sahai @ cs ucla edu - History
- 2026-11-17: revised
- 2026-07-24: received
- See all versions
- Short URL
- https://ia.cr/2026/1511
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/1511,
author = {Prabhanjan Ananth and Seyoon Ragavan and Amit Sahai},
title = {Unconditional Unclonable Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1511},
year = {2026},
url = {https://eprint.iacr.org/2026/1511}
}