Tag Info

New answers tagged


As DrLecter said, any three move identification scheme is a candidate for the use of coupons (i.e. precomputations). Let's describe each move: Commitment (choose randomness) Challenge (choose challenge) Response (compute signature) And that's the first step (commitment) that allow to use coupons. In conclusion, the implication of randomness is specific ...


Actually, it has not really to do with zero-knowledge. From any public-coin three move identification scheme you can derive a secure signature scheme (in the random oracle model) using what is called the Fiat-Shamir heuristic. Many of these protocols represent honest-verifier zero-knowledge proofs (like the Schnorr, GQ etc. protocols). Now, every such ...

Top 50 recent answers are included