Identification schemes in the post-quantum area based on multivariate polynomials with applications in cloud and IoT

Abstract

In this chapter, we survey the identification schemes based on multivariate polynomials over a finite field. We provide some basic definitions needed to construct the structure of identification schemes based on multivariate polynomials over a finite field. Then, we provide a brief survey of identification schemes based on multivariate polynomials by considering applications in different platforms. We analyze them in view of the zero knowledge property and the number of passes such as 3-pass and 5-pass. By considering open problems in the literature, we propose a novel identification scheme based on multivariate quadratic polynomials. Then, we compare them in terms of efficiency. We also provide a discussion for cloud, IoT, and big data applications of quantum secure identification schemes.