Argument of knowledge of a bounded error

Vadym Fedyukovych

Paper 2008/359

Argument of knowledge of a bounded error

Vadym Fedyukovych

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.

Metadata

Available format(s): PDF PS
Category: Cryptographic protocols
Publication info: Published elsewhere. unpublished
Keywords: Goppa code argument of knowledge Schwartz-Zippel lemma zero knowledge
Contact author(s): vf @ unity net
History: 2008-08-18: received
Short URL: https://ia.cr/2008/359
License: CC BY

BibTeX

@misc{cryptoeprint:2008/359,
      author = {Vadym Fedyukovych},
      title = {Argument of knowledge of a bounded error},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/359},
      year = {2008},
      url = {https://eprint.iacr.org/2008/359}
}