Security proofs for hash tree time-stamping using hash functions with small output size

DOI10.1007/978-3-642-39059-3_16MaRDI QIDQ5300948zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ahto Buldas, Risto Laanoja

Publication date 28 June 2013

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39059-3_16

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures
• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• On Provably Secure Time-Stamping Schemes
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Applied Cryptography and Network Security

Cited in

(5)

• Does Secure Time-Stamping Imply Collision-Free Hash Functions?
• Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?
• Simulating auxiliary inputs, revisited
• Applied Cryptography and Network Security
• On Provably Secure Time-Stamping Schemes

This page was built for publication: Security proofs for hash tree time-stamping using hash functions with small output size

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