# Unconditional Unclonable Encryption

DevFeed: [Unconditional Unclonable Encryption](<https://devfeed.tech/articles/unconditional-unclonable-encryption-122775.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.21551>)

Author: Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai

Published: 2026-11-09T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>)

Tags: [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>)

## AI overview

The paper gives an unconditional, information-theoretically secure one-time private-key unclonable encryption scheme for one-bit messages, with efficient encryption and decryption and exponentially small unclonable-indistinguishability advantage. Its key is a uniformly random non-identity phase-free Pauli on n qubits; it encrypts bit a as a random eigenstate with eigenvalue (-1)^a. The authors bound the probability that both receivers recover the bit by 1/2 + O(2^{-n/2}). They say this meets the best probability bound achievable for n-qubit ciphertexts with perfect correctness, up to the constant in the asymptotic term. The abstract contrasts this with prior work that had inverse-polynomial security loss or inefficient operations.

## Source excerpt

arXiv:2607.21551v4 Announce Type: replace-cross 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)$).