Verifiable Random Functions
Verifiable Random Functions is a cryptographic primitive that belongs to the class of pseudorandom functions, distinguished by the property that the function’s output can be publicly verified as correctly computed with respect to a secret key, while remaining unpredictable to any adversary without access to the key.
24
Publications
1.9K
Citations
90
Authors
42
Institutions
Publications per year
2017–2026
18
Variants
Vrfs
24
Silvio Micali, M. O. Rabin, Salil Vadhan · 2003 · 687 citations · Full text
Algorand: Scaling Byzantine Agreements for Cryptocurrencies.
Yossi Gilad, Rotem Hemo, Silvio Micali et al. · IACR Cryptology ePrint Archive · 2017 · 126 citations
Peiying Zhang, Yaqi Wang, Gagangeet Singh Aujla et al. · IEEE Transactions on Intelligent Transportation Systems · 2022 · 79 citations · Full text
1–5 of 24
90
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 90
42
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
2 publications
1.4K citations
Institute of Intelligent Machines
Hefei, China
1 h-index
6 publications
96 citations
China University of Petroleum, East China
Qingdao, China
1 h-index
4 publications
316 citations
Zhejiang Lab
Hangzhou, China
1 h-index
2 publications
150 citations

King Abdulaziz University
Jeddah, Saudi Arabia
1 h-index
1 publications
79 citations
Vellore Institute of Technology University
Vellore, India
1 h-index
2 publications
92 citations
Peng Cheng Laboratory
Shenzhen, China
1 h-index
1 publications
84 citations
University of Science and Technology of China
Hefei, China
1 h-index
6 publications
96 citations
1–8 of 42
Repository · 3 publications · 215 citations
3
h-index
2 publications · 132 citations
2
h-index
Repository · 2 publications · 36 citations
2
h-index
Repository · 1 publications · 180 citations
1
h-index
1 publications · 16 citations
1
h-index
1–5