Metraipolis › archive › dc_e7bec1ab76cf
Verifiable random function — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Verifiable_random_function
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T15:34:29.890Z
- SHA-256 of the archived text
62904c7beb41628e4b8c7528d846e58eeca93c1c5be4b03e64b0fd6fec8f530f- Stable URL of this page
https://metraipolis.com/documento/dc_e7bec1ab76cf
How to cite
Verifiable random function — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Verifiable_random_function (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e7bec1ab76cf (Metraipolis archive dc_e7bec1ab76cf, sha256 62904c7beb41628e4b8c7528d846e58eeca93c1c5be4b03e64b0fd6fec8f530f)
BibTeX
@misc{dce7bec1ab76cf,
title = {Verifiable random function — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Verifiable_random_function},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e7bec1ab76cf; sha256 62904c7beb41628e4b8c7528d846e58eeca93c1c5be4b03e64b0fd6fec8f530f},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Verifiable_random_function. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly. The owner of the secret key can compute the function value as well as an associated proof for any input value. Everyone else, using the proof and the associated public key (or verification key), can check that this value was indeed calculated correctly, yet this information cannot be used to find the secret key. A verifiable random function can be viewed as a public-key analogue of a keyed cryptographic hash and as a cryptographic commitment to an exponentially large number of seemingly random bits. The concept of a verifiable random function is closely related to that of a verifiable unpredictable function (VUF), whose outputs are hard to predict but do not necessarily seem random. The concept of a VRF was introduced by Micali, Rabin, and Vadhan in 1999. Since then, verifiable random functions have found widespread use in cryptocurrencies, as well as in proposals for protocol design and cybersecurity. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»). Fonte: Wikipedia in inglese, voce «Verifiable random function» — https://en.wikipedia.org/wiki/Verifiable_random_function Wikidata Q7921321 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7921321 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Verifiable_random_function?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1366452107, consultata il 2026-10-15T14:51:45.278Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 899700ce3dd69b4a6611bf8a325bce3166df3ae48aacc8d0cde9cf372e98e4dd