4
$\begingroup$

Regular 3-steps Schnorr protocol is a proof of knowledge system for discrete logarithm. It's honest-verifier zero-knowledge, but not full zero-knowledge. My question is, is it witness-hiding? (I guess it should be the most important property in many cases, rather than too strong and not required ZK, and too weak HVZK).

$\endgroup$
1
$\begingroup$

I found the answer: Schnorr protocol is witness-hiding - proved in GGM model in https://www.shoup.net/papers/dlbounds1.pdf (as part of proof that Schnorr identification protocol is secure).

At the same time, it's not possible to prove it in standard model based on discrete-log problem: http://www.cs.cornell.edu/~rafael/papers/schnorr.pdf

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.