Non-interactive cryptographic timestamping based on verifiable delay functions

DOI10.1007/978-3-030-51280-4_29MaRDI QIDQ2226614zbMATH OpenOpenAlexFDO

Authors Esteban Landerreche, Marc Stevens, 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

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

Recommendations

• Non-interactive timestamping in the bounded-storage model
• Advances in Cryptology – CRYPTO 2004
• Publicly verifiable proofs of sequential work
• Verifiable delay functions
• Tight verifiable delay functions

Cited in

(14)

• Non-interactive timestamping in the bounded-storage model
• Verifiable delay functions
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
• Simple and efficient batch verification techniques for verifiable delay functions
• A note on low order assumptions in RSA groups
• Advances in Cryptology – CRYPTO 2004
• Information Security
• Efficient verifiable delay functions
• Short-lived zero-knowledge proofs and signatures
• On time-lock cryptographic assumptions in abelian hidden-order groups
• How (not) to hash into class groups of imaginary quadratic fields?
• Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
• Impossibility of VDFs in the ROM: the complete picture
• Separating verifiable delay functions and time-lock puzzles

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

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