Paper 2023/1197
Towards a Quantum-resistant Weak Verifiable Delay Function
Abstract
In this paper, we present a new quantum-resistant weak Verifiable Delay Function based on a purely algebraic construction. Its delay depends on computing a large-degree isogeny between elliptic curves, whereas its verification relies on the computation of isogenies between products of two elliptic curves. One of its major advantages is its expected fast verification time. However, it is important to note that the practical implementation of our theoretical framework poses significant challenges. We examine the strengths and weaknesses of our construction, analyze its security and provide a proof-of-concept implementation.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. LatinCrypt
- Keywords
- Verifiable Delay FunctionPost-QuantumIsogenyAbelian SurfaceElliptic Curve Product.
- Contact author(s)
-
thomas decru @ kuleuven be
luciano maino @ bristol ac uk
antonio sanso @ ethereum org - History
- 2023-08-07: approved
- 2023-08-07: received
- See all versions
- Short URL
- https://ia.cr/2023/1197
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1197,
author = {Thomas Decru and Luciano Maino and Antonio Sanso},
title = {Towards a Quantum-resistant Weak Verifiable Delay Function},
howpublished = {Cryptology ePrint Archive, Paper 2023/1197},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1197}},
url = {https://eprint.iacr.org/2023/1197}
}
