Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
From MaRDI portal
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
Cites work
- Applied Cryptography and Network Security
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
- Finding collisions on a public road, or do secure hash functions need secret coins?
- How to Time-Stamp a Digital Document
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 826064 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- On provably secure time-stamping schemes
- Theory of Cryptography
- Time-stamping with binary linking schemes
Cited in
(6)- Analysis of client-side security for long-term time-stamping services
- Stamp and extend -- instant but undeniable timestamping based on lazy trees
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Security proofs for hash tree time-stamping using hash functions with small output size
- On provably secure time-stamping schemes
- Applied Cryptography and Network Security
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)
