The Supra DVRF Service Explained - Pratyay Mukherjee
Channel: Protocol Labs
Date: 03/04/2023

Verifiable Random Functions (VRF) are one of the most important cryptographic primitives used for on-chain randomness. VRFs are basically keyed pseudorandom functions that additionally provide public verifiability. To avoid a single point of failure the secret-key is often distributed in a t out of n fashion - which is then called a distributed VRF (DVRF). In this talk I will be talking about Supra DVRF service. In particular, I will first talk about the properties offered by a DVRF, specific details about Supra's DVRF protocols and the framework. Then I will talk about a few problems with the existing DVRFs, which we resolve at Supra by introducing a new concept of output-privacy - this enables significant cost-saving and effectiveness in certain applications. I will then talk about the changes in the constructions (and also in the framework) to achieve output privacy. I will end my talk with a potential optimization technique using Supra's blockchain. 

This is a joint work by Aniket Kate, Easwar Mangipudi, Siva Maradana, and Pratyay Mukherjee