Commitments in Zero Knowledge Proofs

LogN - newly established MVP Workshop's venture is organizing if not first, then one of the first meetups regarding Zero Knowledge Proofs.

ZKPs are tech that is currently changing blockchain and web3, with zkrollups and similar tech. This will be a deep dive into their fundamental part - commitment schemes

Commitments explained

Milan will make an intro into commitments, with focus on explaining PCS (polynomial commitment schemes).

A secure commitment scheme allows a committer to publish a value, called the commitment, which binds to a message (binding) without revealing it (hiding). Later, commitment may be opened and reveal the committed message to a verifier, who can check that the message is consistent with the commitment.

Attack on commitments

Andrija will explain how to make non-interactive protocol from interactive with Fiat-Shamir heuristic.

Zero-knowledge proofs can either be interactive or non-interactive; for the latter the prover only sends his proof and the verifier decides to accept or reject the statement without any further interaction. The Fiat-Shamir transformation is the most efficient construction of non-interactive zero-knowledge proofs. More deeply, will make an emphasis on attacks on protocol if technique is not done correctly.

On PLONK

Marija will talk about PLONK as one example of PCS.

PLONK is a SNARK (Succinct Non-interactive Argument of Knowledge) that can verify a computation done by an arithmetic circuit, meaning you might have a circuit C that on input x outputs C(x)=y and a PLONK proof (generated by the prover) will convince another party (the verifier) that the prover knows x such that C(x) evaluates to y.

***

Tickets are limited, so be sure to secure your seat on time.

See you on Wednesday 8th of December at 6 pm, Impact Hub Belgrade.