Related papers: Cloning Games: A General Framework for Unclonable …

There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent…

We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some…

We propose the concept of pseudorandom states and study their constructions, properties, and applications. Under the assumption that quantum-secure one-way functions exist, we present concrete and efficient constructions of pseudorandom…

Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that…

In this work, we study a generalization of hidden subspace states to hidden coset states (first introduced by Aaronson and Christiano [STOC '12]). This notion was considered independently by Vidick and Zhang [Eurocrypt '21], in the context…

We have found a quantum cloning machine that optimally duplicates the entanglement of a pair of $d$-dimensional quantum systems. It maximizes the entanglement of formation contained in the two copies of any maximally-entangled input state,…

One-time memories (OTM's) are simple, tamper-resistant cryptographic devices, which can be used to implement sophisticated functionalities such as one-time programs. Can one construct OTM's whose security follows from some physical…

A quantum copy-protection scheme (Aaronson, CCC 2009) encodes a functionality into a quantum state such that given this state, no efficient adversary can create two (possibly entangled) quantum states that are both capable of running the…

Quantum fire is a distribution of quantum states that can be efficiently cloned, but cannot be efficiently converted into a classical string. First considered by Nehoran and Zhandry (ITCS'24) and later formalized by Bostanci, Nehoran,…

In recent years, printable graphical codes have attracted a lot of attention enabling a link between the physical and digital worlds, which is of great interest for the IoT and brand protection applications. The security of printable codes…

A common way of stating the non-cloning theorem -- one of distinguishing characteristics of quantum theory -- is that one cannot make a copy of an arbitrary unknown quantum state. Even though this theorem is an important part of the ongoing…

It is known that the classical information like strings of bits can be copied. In 1982, Wootters and Zurek proposed the quantum no-cloning principle. No-cloning principle says that it is impossible to make an identical copy of an arbitrary…

Public key quantum money can be seen as a version of the quantum no-cloning theorem that holds even when the quantum states can be verified by the adversary. In this work, investigate quantum lightning, a formalization of "collision-free…

We show that uncloneable encryption exists with no computational assumptions, with security $\widetilde{O}\left(\tfrac{1}{\lambda}\right)$ in the security parameter $\lambda$.

We show how oracles which only allow for classical query access can be used to construct a variety of quantum cryptographic primitives which do not require long-term quantum memory or global entanglement. Specifically, if a quantum party…

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it.…

The no-cloning principle tells us that non-orthogonal quantum states cannot be cloned, but it does not tell us that orthogonal states can always be cloned. We suggest a situation where the cloning transformations are restricted, leading to…

Encrypted cloning enables the redundant storage of an unknown qubit while remaining compatible with the no-cloning theorem, since only one clone can later be recovered through key-consuming decryption. Because encryption in this protocol is…

Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize…

We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up…