Silvio Micali, Michael Rabin and Salil Vadhan originally developed the concept of verifiable random functions. Verifiable random functions are public key-versions of keyed cryptographic hashes. This means that anyone with a public key can verify the correctness of any hash that was created by holders of secret keys and their computed hashes. The ability to publicly verify the correctness of hash calculations without a way to discover the secret key makes verifiable random functions useful for preventing dictionary attacks on data structures that are hash based. Verifiable random functions are used in applications requiring key transparency, Domain Name System Security Extensions (DNSSEC) , and cryptocurrencies.
Timeline
People
Further reading
Verifiable Random Functions
Silvio Micali, Michael Rabin, Salil Vadhan
Academic
Documentaries, videos and podcasts
Companies
References
Related Topics
Public-key cryptographyCryptographic system requiring two separate keys, one of which is secret and one of which is public
Hash-based cryptography
CryptocurrencyA cryptocurrency (or crypto currency) is a digital asset designed to work as a medium of exchange using cryptography to secure the transactions and to control the creation of additional units of the currency. Cryptocurrencies are a subset of alternative currencies, or specifically of digital currencies.
