Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity

Alexander Vlasov; Konstantin Panarin

Paper 2019/1020

Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity

Alexander Vlasov and Konstantin Panarin

Abstract

We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degree $d$ with a string that can be later used by another side (the verifier) to confirm claimed evaluations of the committed polynomial at specific points. Efficiency means that communication costs of interaction between prover and verifier during the protocol are very small compared to sending the whole committed polynomial itself, and is polylogarithmic in our case. Transparency means that our scheme doesn't require any preliminary trusted setup ceremony. We explicitly state that our polynomial commitment scheme is not hiding, although zero knowledge can be achieved at the application level in most of the cases.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: polynomial commitments zero-knowledge proofs proximity testing
Contact author(s): av @ matterlabs dev
History: 2019-09-11: received
Short URL: https://ia.cr/2019/1020
License: CC BY

BibTeX

@misc{cryptoeprint:2019/1020,
      author = {Alexander Vlasov and Konstantin Panarin},
      title = {Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1020},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1020}
}