Sparse Merkle Trees: Definitions and Space-Time Trade-Offs with Applications for Balloon
This dissertation proposes an efficient representation of a sparse Merkle tree (SMT): an authenticated data structure that supports logarithmic insertion, removal, and look-up in a verifiable manner. The proposal is general in the sense that it can be implemented using a variety of underlying non-au...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Karlstads universitet
2016
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-42913 |