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.
@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/}
}
TY  - JOUR
AU  - V. E. Fedyukovych
TI  - Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 64
EP  - 71
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_4_a5/
LA  - ru
ID  - PDM_2009_4_a5
ER  - 
%0 Journal Article
%A V. E. Fedyukovych
%T Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 64-71
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_4_a5/
%G ru
%F 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/