Skip to Main content Skip to Navigation
Conference papers

Verifiable Delay Functions from Supersingular Isogenies and Pairings

Luca de Feo 1, 2 Simon Masson 3, 4 Christophe Petit 5 Antonio Sanso 6
1 UVSQ - Université de Versailles Saint-Quentin-en-Yvelines
2 IBM Research [Zurich]
3 LCH - Laboratoire Chiffre
4 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
5 University of Birmingham [Birmingham]
6 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 metadata

Cited literature [88 references]  Display  Hide  Download
https://hal.inria.fr/hal-02388349
Contributor : Simon Masson Connect in order to contact the contributor
Submitted on : Sunday, December 1, 2019 - 5:42:18 PM
Last modification on : Friday, January 21, 2022 - 3:10:24 AM
Long-term archiving on: : Monday, March 2, 2020 - 3:48:41 PM

File

Vignette du document
166.pdf
Files produced by the author(s)

Identifiers

Collections

INSMI | UVSQ | UNIV-LORRAINE | LORIA | LORIA-ALGO | INRIA | CNRS | ANR

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

Les métriques sont temporairement indisponibles

 

Contact                    Legal Notice                    Personal Data