Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 239,022,260 papers from all fields of science
Search
Sign In
Create Free Account
Verifiable random function
In cryptography, the concept of a verifiable random function was introduced by Micali, Rabin, and Vadhan. It is a pseudo-random function that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Cryptography
Key (cryptography)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Sequential Proof-of-Work for Fair Staking and Distributed Randomness Beacons
J. I. Orlicki
arXiv.org
2020
Corpus ID: 221266657
We propose a new Proof-of-Stake consensus protocol based on a Sequential Proof-of-Work constructed with a verifiable random…
Expand
2018
2018
Lattice-Based Simulatable VRFs: Challenges and Future Directions
Carlo Brunetta
,
Bei Liang
,
Aikaterini Mitrokotsa
Journal of Internet Services and Information…
2018
Corpus ID: 53067744
Lattice-based cryptography is evolving rapidly and is often employed to design cryptographic primitives that hold a great promise…
Expand
2016
2016
A Novel Verifiable Secret Sharing with Detection and Identification of Cheaters' Group
Qassim Al Mahmoud
2016
Corpus ID: 56065731
Shamir’s (t, n)-SS scheme is very simple to generate and distribute the shares for a secret among n participants by using such…
Expand
2008
2008
Security proof for verifiable random function
Wu Liang
2008
Corpus ID: 124617133
Verifiable random function is used to design the protocol of information security recently.VRF is based on RSA hard problem or…
Expand