The laws of quantum physics mean that prominent classical cryptographic protocols can be broken using quantum computers, but they also permit security guarantees that are classically impossible. For example, quantum states cannot be cloned, which restricts the capabilities of any adversary. Here we show that uncloneable encryption exists with no computational assumptions, with security approaching the ideal value as an inverse-polynomial function of the security parameter. With this scheme, two non-interacting adversaries cannot both learn an encrypted message, even if they are both given the encryption key. Our proof uses the properties of a monogamy-of-entanglement game associated with the Haar measure encryption. Using this connection, we show that any state that succeeds with high probability cannot be close to being maximally entangled between the referee and either of the adversaries. The decoupling principle then implies that either adversary becomes completely uncorrelated and, therefore, cannot win significantly better than random guessing.
Bhattacharyya et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: