On UC-Secure Range Extension and Batch Verification for ECVRF

ePrint Report: On UC-Secure Range Extension and Batch Verification for ECVRF

Christian Badertscher, Peter Gaži, Iñigo Querejeta-Azurmendi, Alexander Russell

Verifiable random functions (Micali et al., FOCS'99) allow a key-pair holder to verifiably evaluate a pseudorandom function under that particular key pair. These primitives enable fair and verifiable pseudorandom lotteries, essential in proof-of-stake blockchains such as Algorand and Cardano, and are being used to secure billions of dollars of capital. As a result, there is an ongoing IRTF effort to standardize …

batch eprint report extension verification