Name
Abstract | ||
|---|---|---|
Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment. |
Year | Venue | DocType |
|---|---|---|
2017 | IACR Cryptology ePrint Archive | Conference |
Volume | Citations | PageRank |
2017 | 4 | 0.38 |
References | Authors | |
22 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rishab Goyal | 1 | 17 | 6.61 |
| Susan Hohenberger | 2 | 1913 | 82.50 |
| Venkata Koppula | 3 | 148 | 10.73 |
| Brent Waters | 4 | 14792 | 541.54 |