On fast verification of hash chains

DOI10.1007/978-3-642-11925-5_26MaRDI QIDQ5189463zbMATH OpenOpenAlexFDO

Authors Dae Hyun Yum, Jinseok Kim, Pil Joong Lee, Sung Je Hong

Publication date 16 March 2010

Published in Topics in Cryptology - CT-RSA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11925-5_26

zbMATH Keywords

check-bit schemehash chainprogressive verification

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Topics in Cryptology – CT-RSA 2004
• Almost optimal hash sequence traversal
• On the computation-storage trade-offs of hash chain traversal
• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• Efficient Constructions for One-Way Hash Chains

Cited in

(4)

• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
• scientific article; zbMATH DE number 7327941 (Why is no real title available?)
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: On fast verification of hash chains

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