Abstract:
A new argument of knowledge protocol with honest verifier is proposed for the Goppa polynomial, codeword and the error of a bounded weight. The soundness of the protocol is based on the hardness assumption for the discrete logarithm problem.
Keywords:interactive argument system, zero knowledge, commitment scheme, Goppa code.