On Provably Secure Time-Stamping Schemes

DOI10.1007/978-3-540-30539-2_35MaRDI QIDQ5465834zbMATH OpenOpenAlexFDO

Authors Ahto Buldas, Märt Saarepera

Publication date 12 August 2005

Full work available at URL https://doi.org/10.1007/978-3-540-30539-2_35

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Applied Cryptography and Network Security
• Security proofs for hash tree time-stamping using hash functions with small output size
• Long-term secure time-stamping using preimage-aware hash functions (short version)

Cited in

(14)

• Some combinatorial aspects of time-stamp systems
• Long-term secure time-stamping using preimage-aware hash functions (short version)
• Analysis of client-side security for long-term time-stamping services
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
• Stamp and extend -- instant but undeniable timestamping based on lazy trees
• scientific article; zbMATH DE number 6712240 (Why is no real title available?)
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• Efficiency Bounds for Adversary Constructions in Black-Box Reductions
• Security proofs for hash tree time-stamping using hash functions with small output size
• Information Security
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Knowledge-Binding Commitments with Applications in Time-Stamping
• Applied Cryptography and Network Security
• A New Approach to Constructing Digital Signature Schemes

This page was built for publication: On Provably Secure Time-Stamping Schemes

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