par De Feo, Luca;Masson, Simon;Petit, Christophe ;Sanso, Antonio
Référence Lecture notes in computer science, 11921 LNCS, page (248-277)
Publication Publié, 2019-04-01
Article révisé par les pairs
Résumé : 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.