Verifiable Delay Functions

Verifiable Delay Functions is a cryptographic primitive that requires a specified amount of sequential computation to evaluate, yet allows for efficient verification of correctness, thereby ensuring that no adversary can produce a valid output faster than the prescribed time bound.

11

Publications

367

Citations

29

Authors

15

Institutions

Publications per year

2017–2026

10

Authors

29

  1. EÖ
    Erdinç Öztürk

    Sabancı Üniversitesi, Türkiye

    2 publications · 43 citations

    2

    h-index

  2. HL
    Huilin Li

    Shaanxi Normal University, China

    1 publications · 25 citations

    1

    h-index

  3. PS
    Philipp Schindler

    Universität Innsbruck, Austria

    1 publications · 11 citations

    1

    h-index

  4. YL
    Yannan Li

    Shaanxi Normal University, China

    1 publications · 25 citations

    1

    h-index

  5. VS
    V. S. Alagar

    Concordia University, Canada

    1 publications · 35 citations

    1

    h-index

1–5 of 29

Venues

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

    Repository · 2 publications · 109 citations

    2

    h-index

  2. Computer Systems Science and Engineering

    1 publications · 24 citations

    1

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 49 citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 11 citations

    1

    h-index

  5. IACR Cryptology ePrint Archive

    Repository · 1 publications · 54 citations

    1

    h-index

1–5