Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth
Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 64-71
Voir la notice de l'article provenant de la source Math-Net.Ru
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
Mots-clés : Goppa code.
Mots-clés : Goppa code.
@article{PDM_2009_4_a5,
author = {V. E. Fedyukovych},
title = {Argument of knowledge protocol for {a~Goppa} codeword and for an error of a~bounded weigth},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {64--71},
publisher = {mathdoc},
number = {4},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_4_a5/}
}
V. E. Fedyukovych. Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth. Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 64-71. http://geodesic.mathdoc.fr/item/PDM_2009_4_a5/