Computationally secure uncloneable encryption scheme

Author

Ma, Zhi ; Lü, Xin ; Feng, Deng-Guo

Author_Institution

State Key Lab. of Inf. Security, Graduate Sch. of Chinese Acad. of Sci., Beijing, China

Volume

2

fYear

2004

fDate

26-29 Oct. 2004

Firstpage

927

Abstract

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.

Keywords

Turing machines; computational complexity; probabilistic automata; public key cryptography; quantum cryptography; NP-complete problems; QPTM; ciphertext; computationally secure encryption scheme; off-line attack immunity; probabilistic polynomial-time Turing machines; quantum polynomial-time Turing machines; quantum public-key encryption; security; uncloneable encryption scheme; Cascading style sheets; Cryptographic protocols; Cryptography; Information security; Linear code; Modems; Polynomials; Public key; Quantum computing; Quantum mechanics;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on

Print_ISBN

0-7803-8593-4

Type

conf

DOI

10.1109/ISCIT.2004.1413855

Filename

1413855