Timeline for Non-Interactive Zero-Knowledge-Proof for discret Logarithm?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2018 at 15:46 | comment | added | relG | Actually I'm looking for a reference that really proves Schnorr is a Nizk-PoK for discrete log in the RO model..anyone know one? | |
| Aug 29, 2018 at 15:46 | comment | added | relG | the extractor that produces x does need to rewind the prover | |
| Feb 22, 2015 at 20:11 | comment | added | Carlo Moretti | How can a simulator repoduce the proof in probabilistic polinomial time without actually know x in a non-interactive proof? | |
| Dec 5, 2012 at 17:41 | vote | accept | CommunityBot | ||
| Dec 5, 2012 at 12:19 | history | answered | Maeher | CC BY-SA 3.0 |