A New 3-pass Zero-knowledge Lattice-based Identification Scheme

Abstract

It is very important that the communicating parties are able to verify their identity in order to communicate with each other properly. Identification schemes are used for this purpose. The identification schemes, widely used in applications, are based on the hardness of the discrete logarithm or integer factorization problem. Shor proposed an algorithm that solve discrete logarithm and factorization problems by using quantum computers in polynomial-time. Therefore, there is a huge need for identification schemes which can be used post-quantum. In this paper, the identification schemes based on hardness of different lattice problems are surveyed. In addition, a new zero-knowledge lattice-based identification scheme is proposed. © 2019 IEEE.