Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / polynomial commitments, zero-knowledge proofs, proximity testing

Date: received 10 Sep 2019, last revised 10 Sep 2019

Contact author: av at matterlabs dev

Available format(s): PDF | BibTeX Citation

Version: 20190911:071809 (All versions of this report)

Short URL: ia.cr/2019/1020


[ Cryptology ePrint archive ]