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.
Cite
CITATION STYLE
APA
De Feo, L., Masson, S., Petit, C., & Sanso, A. (2019). Verifiable delay functions from supersingular isogenies and pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11921 LNCS, pp. 248–277). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-34578-5_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free