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

Authors

90

  1. SM
    Silvio Micali

    Massachusetts Institute of Technology, United States

    2 publications · 813 citations

    2

    h-index

  2. ZY
    Zeyuan Yin

    Zhejiang University of Science and Technology, China

    1 publications · 75 citations

    1

    h-index

  3. QH
    Qi Hu

    Nanjing University, China

    1 publications · 32 citations

    1

    h-index

  4. HM
    Hart Montgomery

    Stanford University, United States

    1 publications · 69 citations

    1

    h-index

  5. HZ
    Hui Zhao

    Inner Mongolia University, China

    1 publications · 48 citations

    1

    h-index

1–5 of 90

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 3 publications · 215 citations

    3

    h-index

  2. IEEE Internet of Things Journal

    2 publications · 132 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 36 citations

    2

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 180 citations

    1

    h-index

  5. Shock and Vibration

    1 publications · 16 citations

    1

    h-index

1–5