Verifiable Delay Functions from Supersingular Isogenies and Pairings

Luca de Feo 1 Simon Masson 2, 3 Christophe Petit 4 Antonio Sanso 5
1 UVSQ - Université de Versailles Saint-Quentin-en-Yvelines
2 LCH - Laboratoire Chiffre
3 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
4 University of Birmingham [Birmingham]
5 Ruhr-Universität Bochum [Bochum]
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [88 references]  Display  Hide  Download
https://hal.inria.fr/hal-02388349
Contributor : Simon Masson <>
Submitted on : Sunday, December 1, 2019 - 5:42:18 PM
Last modification on : Friday, January 10, 2020 - 3:42:23 PM

File

166.pdf
Files produced by the author(s)

Identifiers

Collections

INSMI | UVSQ | UNIV-LORRAINE | LORIA | LORIA-ALGO | INRIA | CNRS | UNIV-PARIS-SACLAY

Citation

Luca de Feo, Simon Masson, Christophe Petit, Antonio Sanso. Verifiable Delay Functions from Supersingular Isogenies and Pairings. Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.248-277, ⟨10.1007/978-3-030-34578-5_10⟩. ⟨hal-02388349⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

39

Files downloads

135

 

 

Contact

archive-ouverte@inria.fr