Skip to main content
11 events
when toggle format what by license comment
Mar 1, 2015 at 21:23 comment added Vadym Fedyukovych Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano, "Noninteractive Zero-Knowledge", 1991, citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.8702
Feb 28, 2015 at 17:03 comment added Carlo Moretti @RobertNACIRI I edited the question, did I get your suggestion right? Thanks
Feb 28, 2015 at 16:39 history edited Carlo Moretti CC BY-SA 3.0
some further consideration based on comments
Feb 28, 2015 at 15:21 comment added Robert NACIRI @Onheiron, I understand, but my question is simple. How the Verifier get (r,y,t)? by telepathie? This is why I said that something is missing. In my sense, in all the ZK protocols I know there is exchange of challenges between P and V.
Feb 28, 2015 at 14:42 comment added Carlo Moretti @Robert NACIRI - this is non-interactive Zero Knowledge Proof, there's no sending of a challenge from V
Feb 24, 2015 at 12:37 comment added Vadym Fedyukovych To make Verifier capable of producing simulated session transcript, one would do an OR-proof: either Prover knows his secret $x$, or he knows Verier's secret (not mentioned in the problem statement).
Feb 23, 2015 at 13:23 comment added xagawa Hint: Notice that the simulator can program the random oracle and the original protocol is honest-verifier ZK.
Feb 22, 2015 at 21:21 comment added Robert NACIRI I think a step where V send a challenge could be missed. For alternative implementation of ZK, you can probably get inspired by the GQ protocol -> en.wikipedia.org/wiki/Zero-knowledge_proof Bye.
Feb 22, 2015 at 20:22 history edited Carlo Moretti
edited tags
Feb 22, 2015 at 20:17 review First posts
Feb 22, 2015 at 20:18
Feb 22, 2015 at 20:10 history asked Carlo Moretti CC BY-SA 3.0