Verifiable Delay Functions from Supersingular Isogenies and Pairings [chapter]

Luca De Feo, Simon Masson, Christophe Petit, Antonio Sanso
2019 Lecture Notes in Computer Science  
We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography. We discuss both the advantages and drawbacks of our constructions, we study their security and we demonstrate their practicality with a proof-of-concept implementation.
doi:10.1007/978-3-030-34578-5_10 fatcat:xz5fbejjdngk7glu5vp7w5gp44