SPV

(redirected from Merkle tree)
Also found in: Dictionary, Encyclopedia.

SPV

Abbreviation for:
saccadic peak velocity
sheep pox virus
simian parvovirus
special purpose vehicle 
splenoportovenography
statement of personal values 
stentless porcine valve
systolic peak velocity
systolic pressure variation
References in periodicals archive ?
- Security Strength: Extended Merkle Tree outputs a half of the XOR Tree bit masking, which is equal to the collision resistance of general Merkle Tree.
Liu, "A position-aware Merkle tree for dynamic cloud data integrity verification," Soft Computing, vol.
Li, "Hierarchy merkle tree wireless sensor network architecture," International Journal of Wireless and Mobile Computing, vol.
Szydlo, "Merkle tree traversal in log space and time," in Advances in cryptology-EUROCRYPT 2004, vol.
In short, our XID protocol employs Merkle tree to identity a cluster of chunks across different image files.
As discussed, Merkle trees are used as a means to efficiently detect common chunk clusters.
In order to improve efficiency of communication and computation in the management of revocations in VANETs, some authors have proposed the use of particular ADSs such as Merkle trees [7] and skip lists [20] [21].
Hash trees also named Merkle trees were proposed in [7] as a protocol to authenticate data integrity efficiently.
Merkle trees are widely used in storage and memory integrity protection.
Then Ugenerates a root R based on the construction of a Merkle Tree, where the leave nodes represents an ordered set of hashes of "file tags", i.e.
Specifically, on receiving the challenge request chal = {([s.sub.i], [r.sub.i]}, CSScomputes [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] In addition, CSS also provides the verifier (U) with a small amount of auxiliary information fig {[[OMEGA].sub.i]}, [s.sub.1] [less than or equal to] i [less than or equal to] [s.sub.c], which denotes the sibling nodes on the path from the leaves H([m.sub.i]), [s.sub.i] [less than or equal to] i [less than or equal to] [s.sub.c] to the root R in the Merkle Tree. Next, CSS responds U with proof P, including the DCS([zeta], [mu]) and [theta], the challenged leaves {H([m.sub.i])}, and the auxiliary information {[Q.sub.i]}.