Computationally secure uncloneable encryption scheme
Zhi Ma, Xin Lü, Dengguo Feng · 2005
A quantum public-key encryption scheme is presented in this paper. In the proposed scheme, ciphertext is described by quantum states and security of this scheme is based on the assumption that NP-complete (NP-C) problems are intractable against quantum (probabilistic) polynomial-time Turing machines (QPTM). One of the main properties of our scheme is that it is immune to off-line attack, in which the adversaries can copy all the ciphertext on channel and analyze them at a later time. We call this type of encryption scheme the computationally secure uncloneable encryption scheme. It is shown that the presented scheme can also be used to encrypt quantum states.