Clifford-based one-time uncloneable encryption extends from one bit to arbitrary-length messages with statistical security and polynomial-time encoding.
The uncloneable bit exists
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves security that approaches the ideal limit at a rate that is exponentially small in the security parameter, without employing any assumptions. Our proof invokes unitary invariance of the shared entangled state and simplifies the adversarial strategies by enforcing this symmetry. Crucially, it then rules out the sender being highly correlated with two non-communicating adversaries at once by an approximation property that we develop, for such unitarily invariant states, which yields a near-optimal bound on the probability of cloning. Consequently, no coordinated strategy beats random guessing of the encrypted bit, establishing unconditional uncloneability. This reveals the existence of an uncloneable bit in Nature and delineates a fundamental, physically enforced cryptographic primitive unavailable in classical settings.
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Statistically secure uncloneable encryption of arbitrary messages
Clifford-based one-time uncloneable encryption extends from one bit to arbitrary-length messages with statistical security and polynomial-time encoding.