133
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...