Applied Cryptography and Network Security

DOI10.1007/11767480zbMATH Open1151.94596OpenAlexW4211109874MaRDI QIDQ5899208FDOQ5899208

Sven Laur, Ahto Buldas

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11767480

Recommendations

• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• On Provably Secure Time-Stamping Schemes
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Security proofs for hash tree time-stamping using hash functions with small output size
• Herding Hash Functions and the Nostradamus Attack

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (4)

• Analysis of client-side security for long-term time-stamping services
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• On Provably Secure Time-Stamping Schemes
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?

This page was built for publication: Applied Cryptography and Network Security

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