English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The powerful no-cloning principle of quantum mechanics can be leveraged toachieve interesting primitives, referred to as unclonable primitives, that areimpossible to achieve classically. In the past few years, we have witnessed asurge of new unclonable primitives. While prior works have mainly focused onestablishing feasibility results, another equally important direction, that ofunderstanding the relationship between different unclonable primitives is stillin its nascent stages. Moving forward, we need a more systematic study ofunclonable primitives. To this end, we introduce a new framework called cloninggames. This framework captures many fundamental unclonable primitives such asquantum money, copy-protection, unclonable encryption, single-decryptorencryption, and many more. By reasoning about different types of cloning games,we obtain many interesting implications to unclonable cryptography, includingthe following:  1. We obtain the first construction of information-theoretically securesingle-decryptor encryption in the one-time setting.  2. We construct unclonable encryption in the quantum random oracle modelbased on BB84 states, improving upon the previous work, which used cosetstates. Our work also provides a simpler security proof for the previous work.  3. We construct copy-protection for single-bit point functions in the quantumrandom oracle model based on BB84 states, improving upon the previous work,which used coset states, and additionally, providing a simpler proof.  4. We establish a relationship between different challenge distributions ofcopy-protection schemes and single-decryptor encryption schemes.  5. Finally, we present a new construction of one-time encryption withcertified deletion.

Cloning Games: A General Framework for Unclonable Primitives