Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

DOI10.1007/978-3-642-00862-7_22zbMath1237.94103OpenAlexW1543324900MaRDI QIDQ3623056

Jae Woo Seo, Dae Hyun Yum, Sungwook Eom, Pil Joong Lee

Publication date: 29 April 2009

Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_22

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

TARD: temporary access rights delegation for guest network devices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal trade-off for Merkle tree traversal
• Almost Optimal Hash Sequence Traversal
• Efficient Constructions for One-Way Hash Chains
• Advances in Cryptology - EUROCRYPT 2004
• Applied Cryptography and Network Security
• Computer Aided Verification
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity