About: Verifiable random function

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Verifiable random function Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FVerifiable_random_function&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdf:type	yago:WikicatCryptographicAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Verifiable random function (en)
rdfs:comment	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. (en)
dcterms:subject	Cryptographic primitives Pseudorandomness Cryptographic algorithms
Wikipage page ID	2431999 (xsd:integer)
Wikipage revision ID	1099207569 (xsd:integer)
Link from a Wikipage to another Wikipage	Cardano (blockchain platform) Preimage attack Public key NP (complexity) Primality test Curve25519 Decision Linear assumption Cryptography Elliptic-curve cryptography Salil Vadhan Silvio Micali Post-quantum cryptography Distributed key generation Domain Name System Hash function Lattice-based cryptography Algorand (cryptocurrency platform) Dictionary attack Internet Computer Artificial intelligence Chainlink (blockchain) Bilinear map Cryptographic primitives Blockchain oracle Pseudorandomness Threshold cryptosystem Zero-knowledge proofs Cryptographic algorithms Solana (blockchain platform) Solidity IETF Internet Draft Michael O. Rabin RSA (cryptosystem) Polkadot (cryptocurrency) Non-interactive zero-knowledge proof Random oracle Smart contract Universal hash function Pseudo-random function Hard-core bit Aleksandr Yampolskiy Secret key Cryptographic commitment dbr:Harmony_(cryptocurrency) dbr:Oraichain dbr:Q-decisional_bilinear_Diffie-Helman_inversion_assumption
Link from a Wikipage to an external page	https://twitter.com/switchboardxyz
sameAs	Verifiable random function Verifiable random function Verifiable random function Verifiable random function
dbp:wikiPageUsesTemplate	dbt:Better_source_needed dbt:How dbt:Short_description dbt:Importance_inline
date	August 2021 (en)
reason	Has this Solidity implementation been used in any notable instance? (en) Has NSEC5 been used in any notable instance? (en)
has abstract	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. (en)
prov:wasDerivedFrom	wikipedia-en:Verifiable_random_function?oldid=1099207569&ns=0
page length (characters) of wiki page	18664 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Verifiable_random_function
is Link from a Wikipage to another Wikipage of	List of blockchains Algorand League of entropy List of cryptocurrencies Chainlink (blockchain) Michael O. Rabin VRF Verifiable unpredictable function
is Wikipage redirect of	Verifiable unpredictable function
is Wikipage disambiguates of	VRF
is known for of	Michael O. Rabin
is known for of	Michael O. Rabin
is foaf:primaryTopic of	wikipedia-en:Verifiable_random_function

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software