Verifiable delay functions from supersingular isogenies and pairings

Luca de Feo, Simon Masson, Christophe Petit, Antonio Sanso

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)
125 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2019
Subtitle of host publication25th International Conference on the Theory and Application of Cryptology and Information Security Kobe, Japan, December 8–12, 2019 Proceedings, Part I
EditorsSteven D. Galbraith, Shiho Moriai
PublisherSpringer
Pages248-277
Number of pages30
ISBN (Electronic)978-3-030-34578-5
ISBN (Print)978-3-030-34577-8
DOIs
Publication statusE-pub ahead of print - 25 Nov 2019
EventAsiacrypt 2019, the 25th Annual International Conference on the Theory and Application of Cryptology and Information Security - Kobe, Japan
Duration: 8 Dec 201912 Dec 2019

Publication series

NameLecture Notes in Computer Science
Volume11921

Conference

ConferenceAsiacrypt 2019, the 25th Annual International Conference on the Theory and Application of Cryptology and Information Security
Country/TerritoryJapan
CityKobe
Period8/12/1912/12/19

Fingerprint

Dive into the research topics of 'Verifiable delay functions from supersingular isogenies and pairings'. Together they form a unique fingerprint.

Cite this