Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.68751OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307274

Michael Szydlo

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97182

zbMATH Keywords

binary treepebblingamortizationMerkle treeauthentication pathfractal traversaltail zipping

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

SoK: how (not) to design and implement post-quantum cryptography ⋮ LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4 ⋮ Efficient pebbling for list traversal synopses with application to program rollback ⋮ Post-quantum cryptography: lattice signatures ⋮ Optimal trade-off for Merkle tree traversal ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Merkle Tree Traversal Revisited ⋮ Digital Signatures Out of Second-Preimage Resistant Hash Functions ⋮ Public Key Authentication with Memory Tokens ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity ⋮ XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004