Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?

DOI10.1007/978-3-540-88733-1_18zbMath1204.94062OpenAlexW1481035401MaRDI QIDQ5505474

Margus Niitsoo, Ahto Buldas

Publication date: 27 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-88733-1_18

Mathematics Subject Classification ID

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

Related Items (2)

Stamp and Extend – Instant But Undeniable Timestamping Based on Lazy Trees ⋮ Analysis of client-side security for long-term time-stamping services

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• How to Time-Stamp a Digital Document
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Advances in Cryptology – CRYPTO 2004
• On Provably Secure Time-Stamping Schemes
• Applied Cryptography and Network Security
• Theory of Cryptography

This page was built for publication: Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?