Questions tagged [starks]
The starks tag has no usage guidance.
9
questions
1
vote
0
answers
17
views
Generic name for R1CS vs. AIR
In the zero-knowledge cryptography nomenclature, we have multiple representations of arbitrary computation suitable for submission to various proof backends (e.g. Groth16). Two specific examples ...
- 111
1
vote
1
answer
232
views
Why are zk-STARK quantum secure?
I have a rough idea of how STARK work, but I want to know which part makes them quantum secure. Is it because when the prover generates the proof they use the random number from the Merkle root, which ...
- 11
2
votes
1
answer
456
views
Is the STARK Curve a SafeCurve?
SafeCurves defines criterias for choosing safe curves in elliptic-curve cryptography.
STARK Curve defines a Stark-friendly elliptic curve that can be used with ECDSA.
I was wondering: Is the STARK ...
- 407
1
vote
1
answer
160
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 ...
- 121
2
votes
0
answers
116
views
It is possible to verify the computation of a hash function without actually proving it in zero knowledge?
Let me first introduce the context: Let's say that we have a hash function evaluation: $$h = H(x, y),$$ where $x$ and $y$ are the public and the private input of the hash function $H$, respectively.
...
- 573
9
votes
1
answer
842
views
Why invent new hash functions for zero-knowledge proofs?
Recently, new hash functions were invented. Their primary purpose is serving the needs of zero-knowledge proof systems. I'm talking about Poseidon-256, Starkad-256, etc. See the paper.
What is the ...
- 269
1
vote
1
answer
184
views
Linear combination IOP for SNARK registers
The STARK paper says
Our ZK-STARK uses a separate Reed-Solomon codeword for each register, leading to w many codewords, each of lower degree ...
- 387
4
votes
1
answer
277
views
Transparent Setup of SNARKs
The STARKs paper states
Third, and most important, ZK-PCPs are transparent (or “public
randomness” ), which means that the randomness used by the verifier is
public; in particular, setting up a ...
- 1,026
2
votes
0
answers
49
views
Assumptions underlying the soundness of STARKs
STARKs have recently received quite a lot of attention due to their small proof size and supposedly simple assumptions.
The paper introduction itself seems to mainly state that their construction is ...
- 1,026