Skip to content
aiqbench takeAI Safety

aiqbench analysis

This study establishes quantum uncloneable encryption with unconditional security, proving that a single ciphertext cannot be decrypted by two non-communicating adversaries even if both possess the key. By leveraging unitary invariance and a novel approximation property, the research achieves near-optimal security bounds without relying on unproven assumptions, effectively ruling out coordinated decryption strategies. The result confirms the existence of a fundamental cryptographic primitive in nature that is physically enforced and unavailable in classical settings.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

The uncloneable bit exists

arXiv2 min read

arXiv:2603.08916v2 Announce Type: replace 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.

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.

arXiv:2603.08916 [quant-ph]

(or arXiv:2603.08916v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2603.08916 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 232 words

Related coverage