Sökning: "Authenticated Data Structures"
Hittade 1 uppsats innehållade orden Authenticated Data Structures.
1. Sparse Merkle Trees: Definitions and Space-Time Trade-Offs with Applications for Balloon
Kandidat-uppsats, Karlstads universitetSammanfattning : 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-authenticated data structures, and it allows trading time for space by the use of an abstract model which represents caching strategies. LÄS MER
Resultatsidor:
1