搜索结果: 1-3 共查到“Merkle Trees”相关记录3条 . 查询时间(0.062 秒)
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 wit...
Efficient Sparse Merkle Trees: Caching Strategies and Secure (Non-)Membership Proofs
Caching Strategies Secure (Non-)Membership Proofs
2016/7/13
A sparse Merkle tree is an authenticated data structure based on a perfect Merkle tree of intractable size. It contains a distinct leaf for every possible output from a cryptographic hash function, an...
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees Technical Report A/390/CRI
Solution-Verification Proof-of-Work Protocol Merkle Trees A/390/CRI
2008/5/22
Proof-of-work schemes are economic measures to deter
denial-of-service attacks: service requesters compute
moderately hard functions that are easy to check
by the provider.