An identification scheme based on a generator matrix of error-correcting codes over GF(q)

Abstract

An identification scheme based on a generator matrix of error-correcting codes over GF(q) is proposed, it is proved that the given protocol is a zero-knowledge interactive proof in the random oracle model, and it is shown that the scheme is secure when parameters are selected properly.