2 votes

How does the verification step operations using FRI polynomial commitments in zk-STARKs?

FRI is not a polynomial commitment scheme per se, although it can be coerced into that interface. What FRI is in exact terms, is an interactive protocol for establishing that committed codeword has ...
Alan's user avatar
  • 1,450
2 votes
Accepted

Impact of security of schnorr's identification verifier when reducing the challenge space

It all depends on what "reducing the challenge space" means. The most direct interpretation of the question is that we consider a normal 3-round Schnorr protocol, with the only modification ...
Marc Ilunga's user avatar
  • 3,163
1 vote

Impact of security of schnorr's identification verifier when reducing the challenge space

For special-sound $\Sigma$-protocols (such as Schnorr's ID scheme), the challenge length can be changed arbitrarily. E.g. to increase the challenge length from $t$ to $2t$, run the protocol twice in ...
lamontap's user avatar
  • 774
1 vote

Difference between Zero Knowledge Proofs and Multi Party Computation

MPC = Compute a function over private inputs from multiple parties without revealing the inputs Example: Two millionaires compute who is richer without revealing their wealth. (Yao's millionaires ...
mti's user avatar
  • 609

Only top scored, non community-wiki answers of a minimum length are eligible