Timeline for "forward-secure" zero knowledge protocols
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2012 at 0:46 | comment | added | user6584 | The standard notion of zero knowledge is <em>auxiliary-input</em> zero knowledge, which is preserved even if the distinguisher is given <em>any</em> auxiliary input (in particular the random bits used to generate the instance to be proven). | |
| Mar 22, 2012 at 17:33 | comment | added | user6973 | (My understanding of the standard definition is that) The cheating prover and the distinguisher are both given the output of an arbitrary algorithm whose input was the instance to be proven; that output is the "auxiliary input". $\:$ In particular, (my understanding is that) the random bits used by that algorithm are normally not available to the distinguisher. $\;\;$ | |
| Mar 22, 2012 at 10:49 | history | answered | user6584 | CC BY-SA 3.0 |