An Improved Zero-knowledge Identification Scheme based on Quasi-Dyadic Codes
Mu Han, Xiaolin Feng, Shidian Ma · International Journal of Security and Its Applications · 2016
In this paper we present an improved version of the zero-knowledge identification scheme based on algebraic coding theory. Our protocol is related to the Veron’s identification scheme but permits a lower communication complexity by transferring two hash values in each round instead of three. And the protocol decreases the cheating probability to about 1/2 instead of 2/3 which reduces the rounds of the protocol. Furthermore, we construct the parity-check matrix in a quasi-dyadic form in order to dramatically reduce the matrix size. In sum, the new scheme has good properties of having a small matrix size, computation complexity, and for an overall communication cost of 22.8kb for authentication.