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

DOI10.1007/978-3-540-88733-1_18zbMATH Open1204.94062OpenAlexW1481035401MaRDI QIDQ5505474FDOQ5505474

Authors: Ahto Buldas, Margus Niitsoo 

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

Recommendations

• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• On Provably Secure Time-Stamping Schemes
• Applied Cryptography and Network Security
• Security proofs for hash tree time-stamping using hash functions with small output size
• Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Analysis of client-side security for long-term time-stamping services
• Applied Cryptography and Network Security
• Security proofs for hash tree time-stamping using hash functions with small output size
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• On Provably Secure Time-Stamping Schemes

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

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