1
$\begingroup$

I am engaged in the research of zk-SNARKs. After I read some papers about zk-SNARKs, I realize the Kate Commitment and the Algebraic Group Model is used a lot since 2019. They are used in Sonic, Plonk, Marlin and etc. Most of these papers are about "universal and updatable zk-SNARKs". I want to know if the Kate Commitment, the AGM and the "universal and updatable zk-SNARKs" have some kind of connection, and what inspired the Kate Commitment, the AGM be used a lot in "universal and updatable zk-SNARKs"?

Hope someone can help me solve this problem, thank you in advance!

$\endgroup$
4
  • $\begingroup$ These zk-SNARKs are universal and updatable beacuse Kate is. More precisely, the structured referenced string (srs) used in the Kate commiment tends to be the commitments of powers of some secret number $s$ up to some exponent $n$. As long as your circuit does not exceed $n$ gates, you can keep using the same srs. Moreover, at any time, you can change this srs with any other (this is why it is updatable). $\endgroup$
    – Bean Guy
    Oct 13 at 15:09
  • $\begingroup$ I think you are right about Kate Commitment. What about AGM? Why it is used a lot since 2019? Almost all of these papers about zk-SNARKs. $\endgroup$
    – 张海军
    Oct 14 at 3:58
  • $\begingroup$ This is due to a more theoretical reason. The AGM is used because it is a security model where it is much more friendly to assume the Q-Discrete Logarithm Assumption (which is necessary to keep the system consistent). $\endgroup$
    – Bean Guy
    Oct 14 at 5:49
  • $\begingroup$ According to Plonk, “real pairing check” means checking element relation in Gi, and “ideal pairing check” means checking relevant element relation in Fp. The q-Dlog Assumption is used to prove the probability gap between these two checks to being negligible. Is it right? $\endgroup$
    – 张海军
    2 days ago

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.