Timeline for Simple application of verifiable random function?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2019 at 16:37 | vote | accept | pg1989 | ||
| Apr 11, 2018 at 6:30 | history | tweeted | twitter.com/StackCrypto/status/983955415552745472 | ||
| Apr 11, 2018 at 1:25 | answer | added | Squeamish Ossifrage | timeline score: 6 | |
| Apr 10, 2018 at 22:29 | history | edited | Squeamish Ossifrage |
VRF tag!
|
|
| Feb 20, 2017 at 20:36 | comment | added | Ryan Amos | @pg1989 A VRF is (not exactly, but close) a PRNG that produces a NIZK proof of correctness. An example of use would be in situations where you don't trust the RNG, or you don't trust the communication line providing the RNG. | |
| Mar 18, 2016 at 20:26 | comment | added | user991 | cs.umd.edu/~jkatz/gradcrypto2/NOTES/lecture12.pdf#page=4 cs.umd.edu/~jkatz/gradcrypto2/NOTES/lecture13.pdf | |
| Mar 18, 2016 at 20:02 | comment | added | pg1989 | How can a VRF be used to construct a NIZK? | |
| Mar 18, 2016 at 11:50 | comment | added | user991 | NIZK | |
| Mar 18, 2016 at 2:24 | history | asked | pg1989 | CC BY-SA 3.0 |