(redirected from Merkle Hash Tree)
MHTMonster Hunter Tri (gaming)
MHTMarshall Islands Time (time zone designation)
MHTMenopause Hormone Therapy
MHTMultiple-Hypothesis Tracking
MHTMultilingual Html
MHTMessage Html
MHTMime Html
MHTMerkle Hash Tree
MHTMississippi Heritage Trust (Jackson, MS)
MHTMental Health Technology (various schools)
MHTMental Health Team
MHTMethod of Handling Traffic (various locations)
MHTMale Hose Thread
MHTManchester, NH, USA - Manchester (Airport Code)
MHTMultiple Hypothesis Testing
MHTMechanical Handling Test
MHTMulti-server Hyper-threading Transportation
MHTMilitary Historical Tours Inc.
MHTMean Holding Time (telecommunication traffic)
MHTMunitions Handling Trailer
MHTMicrosoft Hypertext Archive (file type/extension)
MHTMaster Handicap Technology
References in periodicals archive ?
In the scheme of Hur et al., Use the Merkle hash tree (MHT) to dynamically manage data ownership.
Merkle hash tree [42] is extensively utilized in data integrity [43].
Being different from the signature chain, Merkle [29] first proposed Merkle Hash Tree (MHT), a memory-based binary tree with authentication information, for one-dimensional equality query.
With the aid of Merkle hash tree it is possible for the clients to perform block-level operations on the data files by preserving the level of data correctness assurance.
The basic ADS proposed in [6] is a Merkle hash tree [7] where the leaf nodes represent revoked certificates sorted by serial number.
Additionally, we propose an efficient and secure data integrity scheme based on Merkle hash tree and feature extraction from user's handwriting.
Deng et al [13] [14] builds a hash chain in page level and then builds a Merkle hash tree for each page.
Another idea to solve the problem is introducing the classical authentication data structure Merkle Hash Tree (MHT) into the verification scheme [20].
These can be divided into five categories: Merkle Hash Tree (MHT) based signing approaches [1, 6-8], HMAC-based methods [9, 10], self-verifying name-based methods [11, 12], hash chain-based method [13], and multitoken-based method [14].
Sequence-Enforced Merkle Hash Tree. The sMHT (sequence-enforced Merkle hash tree) [14] is a hash tree structure to solve the problem that the original BLS cannot verify whether the data of the service provider returned is the challenge specified data.
The proposed mechanism makes use of Trapdoor Hash Function (THF) and Merkle Hash Tree (MHT) [1,2] and it integrates them for optimized signing and verification.
We present the essential cryptographic primitives on one-way hash function, cryptographic signature, and Merkle hash tree as follows.