Key-Homomorphic and Aggregate Verifiable Random Functions

ePrint Report: Key-Homomorphic and Aggregate Verifiable Random Functions

Giulio Malavolta

A verifiable random function (VRF) allows one to compute a random-looking image, while at the same time providing a unique proof that the function was evaluated correctly. VRFs are a cornerstone of modern cryptography and, among other applications, are at the heart of recently proposed proof-of-stake consensus protocols. In this work we initiate the formal study of aggregate VRFs, i.e., VRFs that allow for the aggregation of proofs/images into a …

applications compute cornerstone cryptography eprint report function functions heart image key proof random report