Non-interactive cryptographic timestamping based on verifiable delay functions

DOI10.1007/978-3-030-51280-4_29zbMath1459.94124OpenAlexW2927551711MaRDI QIDQ2226614

Marc Stevens, Esteban Landerreche, Christian Schaffner

Publication date: 8 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51280-4_29

zbMATH Keywords

non-interactive cryptographic timestampingnon-PoW blockchain protocolstime-lock cryptographyUniversal Composabilityverifiable delay functions

Mathematics Subject Classification ID

Cryptography (94A60) Macroeconomic theory (monetary models, models of taxation) (91B64) Financial applications of other theories (91G80)

Related Items (5)

Short-lived zero-knowledge proofs and signatures ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era ⋮ A note on Low Order assumptions in RSA groups

This page was built for publication: Non-interactive cryptographic timestamping based on verifiable delay functions