Does Secure Time-Stamping Imply Collision-Free Hash Functions?

DOI10.1007/978-3-540-75670-5_9zbMath1138.94349OpenAlexW1603161560WikidataQ57275822 ScholiaQ57275822MaRDI QIDQ3503876

Aivo Jürgenson, Ahto Buldas

Publication date: 10 June 2008

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75670-5_9

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? ⋮ Analysis of client-side security for long-term time-stamping services

Cites Work

• Unnamed Item
• Unnamed Item
• Herding Hash Functions and the Nostradamus Attack
• Advances in Cryptology – CRYPTO 2004
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• On Provably Secure Time-Stamping Schemes
• Topics in Cryptology – CT-RSA 2005
• Applied Cryptography and Network Security
• Theory of Cryptography

This page was built for publication: Does Secure Time-Stamping Imply Collision-Free Hash Functions?