Skip to main content
4 events
when toggle format what by license comment
Sep 27, 2017 at 11:08 comment added Ievgeni If the proof is non interactive, then yeah, you can suppose everything about the verifier. But if the proof is interactive, then sometime (like in the Schnorr protocol) you can't prove the zero-knowledgess, if you don't assume the honesty of the verifier.
Sep 26, 2017 at 17:47 comment added Andreas Blass I'd expect a zero-knowledge proof to avoid leaking information, even to a dishonest verifier, as long as the prover is honest.
Sep 26, 2017 at 14:45 review Late answers
Sep 26, 2017 at 14:52
Sep 26, 2017 at 14:28 history answered Ievgeni CC BY-SA 3.0