Cost(π/8), representing optimal joint success probability in the BB84 monogamy-of-entanglement game, now defines a new standard for unclonable encryption security. Previously upgrading existing schemes from ‘search’ security, where recipients attempted to recover an entire message, to ‘unclonable indistinguishability’, a gold standard requiring attackers fail to distinguish between two encrypted messages, proved challenging. Andrea Coladangelo and colleagues have advanced unclonable encryption, a method designed to protect data even when intercepted and processed before decryption, by moving beyond basic security levels.

Previously systems relied on ‘search’ security; now they achieve ‘indistinguishable results, meaning adversaries cannot differentiate between encryptions of different messages. This improvement was achieved using a standard cryptographic system built upon BB84 states, suggesting wider applicability than purely theoretical gains. Andrea Coladangelo and colleagues have built upon recent advances in unclonable encryption, data designed to remain secure even when intercepted, by achieving a key upgrade from basic ‘search’ security to the more strong ‘indistinguishability.

Previously, systems were evaluated on whether an attacker could recover the entire encrypted message; now evaluation focuses on whether attackers can differentiate between encryptions of two distinct messages. This improvement uses a cryptographic system based on BB84 states which encode information using polarised photons; any attempt to observe these photons alters them, acting like a broken wax seal revealing tampering.

The team employed a new application of what is known as a Goldreich-Levin reduction, a method for verifying someone knows a secret without learning it directly, akin to observing repeated successful safe unlocks without seeing the combination itself.

Advancing unclonable encryption via simultaneous Goldreich-Levin reduction applications

The researchers of Washington, UC San Diego and Tsinghua University have transformed basic unclonable encryption schemes into systems meeting a gold standard of security; achieving this level was previously considered challenging. This establishes that even simple encryption derived from BB84 states now meets this enhanced benchmark, signifying progress towards more robust data protection protocols.

A significant leap forward has occurred in securing digital information through these advancements. A novel application of Goldreich-Levin reductions applied simultaneously to entangled parties attempting to guess encrypted values underpins this improvement; traditional methods assessed each party individually. Upgraded encryption schemes achieve unclonable indistinguishibility, a sharp leap forward given the previous difficulty of attaining such security levels.

The method uses this new ‘simultaneous’ approach, a cryptographic technique converting partial information about hidden data into full recovery across two entangled parties concurrently deciphering encrypted values. Prior approaches evaluated each component separately, improving efficiency and bolstering overall security. Initial support for this discovery originated from GPT-5.6 Ultra following prompts incorporating recent findings by Ananth & Sahai and Ragavan.

Advancing unclonable encryption through indistinguishability and simultaneous verification protocols

The team’s work offers a pathway to fortifying unclonable encryption; data protection remains secure even if intercepted, by moving beyond simply detecting full message recovery by attackers towards preventing them from distinguishing between different encrypted versions of the same data. This advance relies on applying a Goldreich-Levin reduction across two entangled parties instead of assessing each individually under specific conditions, namely that they share identical random challenges. While its importance for practical security systems is significant, this condition must be met for optimal performance.

This refinement moves beyond existing methods offering stronger guarantees against sophisticated adversaries attempting to compromise sensitive information through advanced analytical techniques. Researchers have enabled any scheme with ‘search’ security to achieve ‘indistinguishability’, previously difficult to upgrade schemes to this standard.

The breakthrough centres on applying a cryptographic technique converting partial data into full recovery to two entangled parties guessing encrypted values using identical random challenges, unlike traditional approaches which assessed each separately. Consequently, even basic encryption systems built upon BB84 states, utilising polarised photons that change when observed, now meet indistinguishibility benchmarks suggesting broad applicability beyond theoretical models.

The research demonstrated a method for enhancing unclonable encryption by upgrading schemes from ‘search’ security to the more robust ‘indistinguishability’. This matters because it prevents attackers from differentiating between different encryptions of the same information, offering stronger protection than simply detecting if an attacker recovers the complete message. As a result, even simple BB84 state-based encryption systems now satisfy these higher security standards.

👉 More information
🗞 Unclonable encryption from BB84 states: a simultaneous Goldreich-Levin reduction
✍️ Andrea Coladangelo, Qipeng Liu and Ziyi Xie
🧠 ArXiv: https://arxiv.org/abs/2608.17629

More like this