Essays about: "Sparse Merkle Tree SMT"
Found 2 essays containing the words Sparse Merkle Tree SMT.
-
1. LF-PKI: Practical, Secure, and High-Performance Design and Implementation of a Lite Flexible PKI
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Today’s Web Public Key Infrastructure (PKI) builds on a homogeneous trust model. All Certificate Authorities (CAs) are equally trusted once they are marked as trusted CAs on the client side. As a result, the security of the Web PKI depends on the weakest CA. READ MORE
-
2. Sparse Merkle Trees: Definitions and Space-Time Trade-Offs with Applications for Balloon
University essay from Karlstads universitetAbstract : 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. READ MORE