Протокол аргумента знания слова кода Гоппы и ошибки ограниченного веса

Abstract

A new protocol is introduced to show knowledge of a Goppa polynomial and of a codeword, as well as that error is of a bounded weight. The protocol is a special honest verifier zero knowledge proof under assumption of the discrete logarithm problem hardness.