International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Argument of knowledge of a bounded error

Authors:
Vadym Fedyukovych
Download:
URL: http://eprint.iacr.org/2008/359
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2008-18036,
  title={Argument of knowledge of a bounded error},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / Goppa code, argument of knowledge, Schwartz-Zippel lemma, zero knowledge},
  url={http://eprint.iacr.org/2008/359},
  note={unpublished vf@unity.net 14109 received 18 Aug 2008},
  author={Vadym Fedyukovych},
  year=2008
}