Cryptology ePrint Archive: Report 2008/359
Argument of knowledge of a bounded error
Abstract: A protocol is introduced to show knowledge of a codeword of Goppa code
and Goppa polynomial.
Protocol does not disclosure any useful information about
the codeword and polynomial coefficients.
A related protocol is introduced to show
Hamming weight of an error is below a threshold.
Protocol does not disclosure codeword and weight of the error.
Verifier only uses commitments to codeword components and coefficients
while testing validity of statements.
Both protocols are honest verifier zero knowledge.
Category / Keywords: cryptographic protocols / Goppa code, argument of knowledge, Schwartz-Zippel lemma, zero knowledge
Publication Info: unpublished
Date: received 18 Aug 2008
Contact author: vf at unity net
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20080818:184748 (All versions of this report)
Short URL: ia.cr/2008/359
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]