Merkle Tree Traversal Techniques - CDC
Merkle Tree Traversal Techniques - CDC
Merkle Tree Traversal Techniques - CDC
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Index<br />
Abstract 5<br />
Chapter 1: Introduction 6<br />
Chapter 2: The Basics 8<br />
2.1 Hash and One–Way Functions 8<br />
2.1.1 One - Way Functions 8<br />
2.1.2 Hash functions 9<br />
2.2 Digital Signatures 9<br />
2.2.1 The Definition 9<br />
2.2.2 One - Time Digital Signatures 10<br />
2.3 The Original <strong>Merkle</strong> Digital Signature 10<br />
2.3.1 Introduction 10<br />
2.3.2 The Lamport-Diffie one-time signature scheme 11<br />
2.3.3 Winternitz improvement 12<br />
2.3.4 <strong>Merkle</strong> trees 12<br />
2.3.5 Authentication Paths 13<br />
Chapter 3: <strong>Tree</strong> <strong>Traversal</strong> <strong>Techniques</strong> 14<br />
3.1 Authentication Path Regeneration 14<br />
3.2 Efficient Nodes Computation 14<br />
3.3 The Classic <strong>Traversal</strong> 16<br />
3.3.1 Key Generation and Setup 16<br />
3.3.2 Output and Update 17<br />
3.3.3 Example for the Classic <strong>Traversal</strong> 18<br />
3.4 Fractal <strong>Tree</strong> Representation and <strong>Traversal</strong> 25<br />
3.4.1 Notation 25<br />
3.4.2 Existing and Desired Subtrees 26<br />
3.4.3 Algorithm Presentation 27<br />
3.4.4 Example for the fractal algorithm 29<br />
3