Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Verifiable random function

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 4 years ago by 37.164.12.238

Could someone elaborate on the construction of Micali (1999) on how the VUF works. I read the original paper and I didn't understand it, how the VUF itself worked and was evaluated and how you evaluate the function and get a proof, but also how to convert the VUF to a VRF.

BLS signatures are about the worst choice for a VRF for almost any realistic situation. Schnorr DLEQ proof based VRFs work well. RSA-FHD is not as fast as Rabin-Williams, but many Rabin variants are not VRFs. RSA-PSS is not a VRF and infinitely more common than RSA-FDH in the wild.  Preceding unsigned comment added by 188.62.22.15 (talk) 17:44, 7 February 2020 (UTC)Reply

This should probably mention the "BADA55" criticisms of the VRF concept. i.e. [] Wonderstruck (talk) 04:38, 4 January 2021 (UTC)Reply

Absolutely nothing on the BADA55 site discusses VRFs. It's talking about curves parameter choice, a totally unrelated idea.  Preceding unsigned comment added by 37.164.12.238 (talk) 06:50, 13 January 2022 (UTC)Reply