F-TLP — Time-lock puzzle, verifiable delay function

F-TLP (Time-lock puzzle, verifiable delay function) is part of Time and Application Composites in the UC functionality encyclopedia. Status: a canonical, well-established UC functionality.

Verifiable delay functions are folded into this functionality, on the same logic as the generic-group merge above (see G-GG). The merge is slightly lossy: a verifiable delay function is publicly verifiable, whereas a time-lock puzzle need not be, so this entry understates that distinction.

References:

• Baum et al. TARDIS: A foundation of time-lock puzzles in UC. In Advances in Cryptology – EUROCRYPT 2021, Part III, volume 12698 of LNCS, pages 429–459, 2021.
• Rivest, Shamir, and Wagner. Time-lock puzzles and timed-release crypto. Technical Report MIT/LCS/TR-684, MIT, 1996.