Paper 2018/955

Compact Sparse Merkle Trees

Faraz Haider

Abstract

A Sparse Merkle tree is based on the idea of a complete Merkle tree of an intractable size. The assumption here is that as the size of the tree is intractable, there would only be a few leaf nodes with valid data blocks relative to the tree size, rendering the tree as sparse. We present a novel approach called Minimum distance path algorithm to simulate this Merkle tree of intractable size which gives us efficient space-time trade-offs. We provide the algorithms for insertion, deletion and (non -) membership proof for a leaf in this Compact Sparse Merkle tree.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. https://osf.io/8mcnh/
DOI
10.31219/osf.io/8mcnh
Keywords
zero knowledgehash functions
Contact author(s)
haider faraz @ outlook com
History
2018-10-09: received
Short URL
https://ia.cr/2018/955
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/955,
      author = {Faraz Haider},
      title = {Compact Sparse Merkle Trees},
      howpublished = {Cryptology ePrint Archive, Paper 2018/955},
      year = {2018},
      doi = {10.31219/osf.io/8mcnh},
      note = {\url{https://eprint.iacr.org/2018/955}},
      url = {https://eprint.iacr.org/2018/955}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.