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
Parents
11
29
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 29
15
Sabancı Üniversitesi
Istanbul, Türkiye
2 h-index
4 publications
65 citations
University of Vienna
Vienna, Austria
1 h-index
2 publications
22 citations
Institut Polytechnique de Bordeaux
Bordeaux, France
1 h-index
1 publications
49 citations

University of Wollongong
Wollongong, Australia
1 h-index
1 publications
25 citations

Beihang University
Beijing, China
1 h-index
1 publications
25 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
49 citations

TU Wien
Vienna, Austria
1 h-index
3 publications
33 citations
Institut de Mathématiques de Bordeaux
Talence, France
1 h-index
1 publications
49 citations
1–8 of 15
Repository · 2 publications · 109 citations
2
h-index
1 publications · 24 citations
1
h-index
Repository · 1 publications · 49 citations
1
h-index
1 publications · 11 citations
1
h-index
Repository · 1 publications · 54 citations
1
h-index
1–5