We propose two interactive identification protocols based on a general construction of quantum public-key cryptosystem. Basic protocol contains set-up phase and authentication phase. Participants do operation with quantum computing of Boolean function in two-round transmission of authentication phase. Basic one only ensures completeness and soundness, but leaks information about private-key. We modify basic protocol with random string and random Boolean permutation. After modification, both transmitted states in two-round transmission can be proved to be ultimate mixed states. No participant or attacker will get useful information about private-key by measuring such states. Modified protocol achieves property of zero-knowledge.
In most traditional quantum public-key cryptosystems, the public key held by the key management center (KMC) is a group of quantum systems. The public key is destroyed after a secret communication process, and so users must reconstruct the public key with the KMC after every communication process or hold many copies of the public key in the beginning. This requirement is an obstacle to the practical application of such quantum cryptosystems. This paper describes a quantum public-key cryptosystem with reusable keys using entangled states. Each user shares a set of entangled quantum systems with the KMC as that individual user’s (public key, private key) pair. Two users can exchange secret communications with the help of the KMC. Moreover, the states of the quantum systems revert to their original states. The user’s (public key, private key) pair is unchanged so that the keys are reusable. It is unnecessary for users to reconstruct the public key with the KMC or save many copies of the public key in the KMC. As a result, this public-key cryptosystem is much less expensive to manage and easier to realize in practice than most traditional quantum public-key cryptosystems.
Abstract In 2005, O.Regev proposed the first LWE public key cryptosystem at Tel Aviv University in Israel based on LWE distribution
As,χ . Because of this paper, Regev won the highest award for theoretical computer science in 2018—the Godel Award. The size of public key is
O~(n2) bits, and the size of private key s and ciphertext is
O~(n) bits. The plaintext encrypted each time is 1 bit. In fact, the LWE public key cryptosystem is a probabilistic cryptosystem, which depends on a high probability algorithm. Since the security of LWE problem has been clearly proved (see Chap. 3 ), the LWE cryptosystem has received extensive attention as soon as it was proposed, and it becomes the most cutting-edge research topic in the lattice-based cryptosystem study.