Wiktionary

Merkle tree

English edit

 
English Wikipedia has an article on:
Wikipedia

Etymology edit

Named after American computer scientist Ralph Merkle (1952–), who patented it in 1979.

Noun edit

Merkle tree (plural Merkle trees)

  1. (computer science, cryptography) A binary hash tree.
    • 2001, Josep Domingo-Ferrer, Mobile Agent Route Protection through Hash-Based Mechanisms, C. Pandu Rangan, Cunsheng Ding (editors), Progress in Cryptology - INDOCRYPT 2001: 2nd International Conference, Proceedings, Volume 2, Springer, LNCS 2247, page 17,
      The second solution uses Merkle trees and minimizes the cost of route protection by the agent owner, so that a single digital signature suffices to protect the whole route; for hosts along the route, the verification cost is similar to the cost of previous schemes in the literature, namely one digital signature verification per route step.
    • 2004, Michael Szydlo, Merkle Tree Traversal in Log Space and Time, Christian Cachin, Jan Camenisch (editors), Advances in Cryptology - EUROCRYPT 2004: International Conference, Proceedings, Springer, LNCS 3027, page 541,
      Merkle trees have found many uses in theoretical cryptographic constructions, having been specifically designed so that a leaf value can be verified with respect to a publicly known root value and the authentication data of the leaf.
    • 2015, Puonam M. Pardeshi, Bharat Tidke, “Improvement of Data Integrity and Data Dynamics for Data Storage Security in Cloud Computing”, in J. K. Mandal, Suresh Chandra Satapathy, Manas Kumar Sanyal, Partha Pratim Sarkar, Anirban Mukhopadhyay, editors, Information Systems Design and Intelligent Applications, Proceedings of 2nd International Conference, Volume 1, Springer, page 279:
      In order to support dynamic data operations, the Merkle Tree is made dynamic by making use of relative index.

Translations edit

See also edit

Further reading edit

Retrieved from "https://en.wiktionary.org/w/index.php?title=Merkle_tree&oldid=75847439"