Necessity of large primes and delay commitment in efficient verifiable delay function

DOI10.1504/IJACT.2025.147919MaRDI QIDQ6900823zbMATH OpenFDO

Authors Souvik Sur

Publication date 12 November 2025

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJACT.2025.147919

zbMATH Keywords

computational soundnessRSW assumptionsequentialityverifiable delay functions

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: Necessity of large primes and delay commitment in efficient verifiable delay function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900823)