link.springer.com/chapter/10.1007/978-3-540-24676-3_32

Preview meta tags from the link.springer.com website.

Linked Hostnames

23

Thumbnail

Search Engine Appearance

Google

https://link.springer.com/chapter/10.1007/978-3-540-24676-3_32

Merkle Tree Traversal in Log Space and Time

We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of...



Bing

Merkle Tree Traversal in Log Space and Time

https://link.springer.com/chapter/10.1007/978-3-540-24676-3_32

We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of...



DuckDuckGo

https://link.springer.com/chapter/10.1007/978-3-540-24676-3_32

Merkle Tree Traversal in Log Space and Time

We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of...

  • General Meta Tags

    33
    • title
      Merkle Tree Traversal in Log Space and Time | SpringerLink
    • charset
      UTF-8
    • X-UA-Compatible
      IE=edge
    • viewport
      width=device-width, initial-scale=1
    • applicable-device
      pc,mobile

  • Open Graph Meta Tags

    6
    • og:url
      https://link.springer.com/chapter/10.1007/978-3-540-24676-3_32
    • og:type
      Paper
    • og:site_name
      SpringerLink
    • og:title
      Merkle Tree Traversal in Log Space and Time
    • og:description
      We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of...

  • Twitter Meta Tags

    6
    • twitter:site
      SpringerLink
    • twitter:card
      summary
    • twitter:image:alt
      Content cover image
    • twitter:title
      Merkle Tree Traversal in Log Space and Time
    • twitter:description
      We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of...

  • Item Prop Meta Tags

    3
    • position
      1
    • position
      2
    • position
      3

  • Link Tags

    9
    • apple-touch-icon
      /oscar-static/img/favicons/darwin/apple-touch-icon-92e819bf8a.png
    • canonical
      https://link.springer.com/chapter/10.1007/978-3-540-24676-3_32
    • icon
      /oscar-static/img/favicons/darwin/android-chrome-192x192-6f081ca7e5.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-32x32-1435da3e82.png
    • icon
      /oscar-static/img/favicons/darwin/favicon-16x16-ed57f42bd2.png

Links

65