Verifiable Delay Functions from Supersingular Isogenies and Pairings
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...