Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Groth16/ #12

Open
utterances-bot opened this issue Jul 26, 2024 · 2 comments
Open

Groth16/ #12

utterances-bot opened this issue Jul 26, 2024 · 2 comments

Comments

@utterances-bot
Copy link

Groth16 zkSNARK – Risen Crypto – Mathematical Cryptography, zkSNARKs

Groth16 is a zkSNARK protocol introduced by Jens Groth in 2016 & it saw an early application in ZCash. Its proof size is among the smallest (consisting of only three elliptic curve elements) and it is also the fastest to verify

https://risencrypto.github.io/Groth16/

Copy link

skaunov commented Jul 26, 2024

"Pre-requisite Topics / Polynomial Commitment Schemes & Elliptic Curve Pairings" ends with product of $e$ which [I couldn't find] at https://risencrypto.github.io/Kate/. Would be cool to have a word or two on that right there.
[I couldn't find]: I'm on a phone, so apologies if that's just a miss.

@RisenCrypto
Copy link
Owner

RisenCrypto commented Jul 27, 2024

"Pre-requisite Topics / Polynomial Commitment Schemes & Elliptic Curve Pairings" ends with product of e which [I couldn't find] at https://risencrypto.github.io/Kate/. Would be cool to have a word or two on that right there. [I couldn't find]: I'm on a phone, so apologies if that's just a miss.

I have explained how from m=ab+cd, you can derive e(mG_1,G_2) = e(G_1,G_2)^{ab} . e(G_1,G_2)^{cd} in the current post itself. Or are you asking about something else?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants