Questions tagged [snarks]
SNARKS (short non-interactive arguments of knowledge) are space efficient zero-knowledge proof that do not require input from a verifier.
10 questions
8
votes
3
answers
3k
views
Why it is said that “zk-SNARKs need a trusted setup” to work?
What is the meaning of a "trusted setup" in this context? It is often said all around that zk-STARKs and Bulletproofs does not require a trusted setup. How do zk-STARKs and Bulletproofs ...
- 181
2
votes
1
answer
595
views
What is the difference between those two KZG Polynomial Commitment Schemes?
In short what are the differences (pros & cons) between multiplying by powers of Tau
(from this lecture https://youtu.be/tAdLHQVW)
and raising to powers of Tau
(from this lecture https://youtu.be/...
- 160
1
vote
1
answer
459
views
Why Zk-SNARKs are Argument of Knowledge if a Knowledge Extractor exists?
From what I know, proving the existance of a Knowledge Extractor implies perfect soundness.
So why in zk-SNARKs (and similar) we talk about Arguments of Knowledge, where the soundness property is only ...
- 151
1
vote
1
answer
113
views
Recursive snarks with a genus-2 no-cycle hyperelliptic curve?
Any hyperelliptic curve having base field characteristic dividing group order?
A subgroup of order equal to the basefield characteristic, a large prime?
Having hard DLP in that subgroup?
Having ...
- 2,317
1
vote
1
answer
208
views
How exactly bilinear pairing multiplication in the exponent of g is used in zk-SNARK polynomial verification step?
I am reading this explanation of zkSnark written by Maksym Petkus - https://arxiv.org/pdf/1906.07221.pdf
In page 24, the zk-SNARK of polynomial is explained. In setup phase, the proving and ...
1
vote
1
answer
108
views
PLONK Prod Check Proof - why does it have to be proven upto the last element of the set? It should be enough to prove it upto last but one element
I am going through Dan Boneh's video on PLONK - https://www.youtube.com/watch?v=LbpPCN-f_XA&t=952s
At around 19 minutes, he gets to the Prod Check Gadget.
Background:
$\omega \in \mathbb F_p$ is ...
- 2,316
1
vote
1
answer
74
views
Prod Check Gadget in PLONK - any polynomial which satisfies the prod check seems to be the trivial polynomial
In Dan Boneh's PLONK Video - https://www.youtube.com/watch?v=vxyoPM2m7Yg he refers to the Prod Check Gadget
$\omega \in F_p$ is a primitive $k$-th root of unity ($\omega^{k-1} = 1$)
$H = \{1, \omega, \...
- 2,316
0
votes
2
answers
162
views
PLONK: Reducing the number of Field Elements Trick
From the PLONK paper.
Page 18
We describe an optimization by Mary Maller to reduce the number of $F$-elements in the proof from $M$. We begin with an illustrating example. Suppose $V$ wishes to check ...
- 2,316
0
votes
1
answer
92
views
Sumcheck Protocol: How to represent a matrix as an MLE which takes row & column numbers as parameters?
This is from Justin Thaler's book - Proofs, Arguments & Zero Knowledge
Page 43
For it to make sense to talk about multilinear extensions, we need to view the adjacency matrix $A$ not as a matrix, ...
- 2,316
0
votes
1
answer
98
views
can secrets be deciphered from the proofs generated with ZK-Snarks if a quantum attack were plausible?
can secrets be deciphered from the proofs generated with ZK-Snarks if a quantum attack were plausible?
I understand the concern that ZK-snarks and some of their cryptography may be broken by quantum ...
- 3