Verifiable Random Function
E413706
UNEXPLORED
A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.
Jump to:
Referenced by
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.