Serguey Priymak

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In identification protocols with public verifier coins (like Fiat-Shamir), a passive adversary watching the communication gains information intended only for the verifier. On the other hand, private coin protocols with fewer than three rounds cannot be zero-knowledge. In this paper, we introduce the notion of bounded-prover zero-knowledge proofs which(More)
  • 1