Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:open.bu.edu:2144/29225

Verifiable Random Functions (VRFs)

Authors
Publication date
31 May 2018
Publisher
Internet Engineering Task Force

Abstract

A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies several VRF constructions that are secure in the cryptographic random oracle model. One VRF uses RSA and the other VRF uses Eliptic Curves (EC).https://datatracker.ietf.org/doc/draft-irtf-cfrg-vrf/First author draf

    Similar works

    Full text

    thumbnail-image

    Boston University Institutional Repository (OpenBU)

    redirect
    oaioai:open.bu.edu:2144/29225
    Last time updated on 09/07/2019

    This paper was published in Boston University Institutional Repository (OpenBU).

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.