How Merkle trees enable the decentralized Web! @taravancil - PowerPoint PPT Presentation

Dec 19, 2022 •365 likes •618 views

How Merkle trees enable the decentralized Web! @taravancil taravancil.com RESOURCES Host-based addressing youtube.com/myvideo Host-based addressing youtube.com/myvideo -> vimeo.com/myvideo Content addressing - hash functions Content

How Merkle trees enable the decentralized Web! @taravancil taravancil.com
RESOURCES
Host-based addressing youtube.com/myvideo
Host-based addressing youtube.com/myvideo -> vimeo.com/myvideo
Content addressing - hash functions
Content addressing - hash functions 2cf24dba5fb0a30e26e83b2ac5 hash( ) -> b9e29e1b161e5c1fa7425e7304 3362938b9824
Regular binary tree 7 6 5 1 2 3 4
= hash(left, right) R L = hash(data) L R L R
Merkle tree 1 2 3 4
Merkle tree 1 2 h(1) h(2) h(3) h(4) 3 4
Merkle tree h(h(3), h(4)) B h(h(1), h(2)) A 1 2 h(1) h(2) h(3) h(4) 3 4
Merkle tree h(A, B) C h(h(3), h(4)) B h(h(1), h(2)) A 1 2 h(1) h(2) h(3) h(4) 3 4
Merkle tree Root hash h(A, B) C h(h(3), h(4)) h(h(1), h(2)) B A 1 2 h(1) h(2) h(3) h(4) 3 4
Checking for equality C != F F C E B A A h(1) h(2) h(3) h(5) h(1) h(2) h(3) h(4)
C C B A 1 2 h(1) h(2) h(3) h(4) 3 4
What if? hash( ) 1 2 3 4 = Root hash
partial verification
UNTRUSTED PEER RECIPIENT C
UNTRUSTED PEER RECIPIENT 4 C
UNTRUSTED PEER RECIPIENT 4 C h(4)
UNTRUSTED PEER RECIPIENT 4 C h(3) B h(3) h(4)
UNTRUSTED PEER RECIPIENT 4 C h(3) B A A h(3) h(4)
thanks! @taravancil

Recommend

Berkeley CS276 & MIT 6.875 Merkle Trees and Transparency Logs Lecturer: Raluca Ada Popa Oct

Berkeley CS276 & MIT 6.875 Merkle Trees and Transparency Logs Lecturer: Raluca Ada Popa Oct 12, 2020 Announcements Starting to record This lecture: Applied: practice digital signatures and CRH in a real cryptographic system

439 views • 27 slides

Fixing healthcare data exchange with decentralized FOSS Protect your API's with a decentralized

Fixing healthcare data exchange with decentralized FOSS Protect your API's with a decentralized trust layer Steven van der Vegt Open standard to enable safe and correct exchange of healthcare data. Goal Create a (inter)national network of

708 views • 35 slides

Decentralized Key Management for Large Dynamic Multicast Groups using Distributed Balanced Trees

Decentralized Key Management for Large Dynamic Multicast Groups using Distributed Balanced Trees Thesis by Junaid Haroon MSCS018 Supervised by Mr Shafiq ur Rahman Flow of Presentation Background Proposed Scheme Analysis

840 views • 56 slides

Stop the Software Architecture Erosion Bernhard Merkle Central Research & Development

Stop the Software Architecture Erosion Bernhard Merkle Central Research & Development Software-Engineering SICK-AG Waldkirch mailto: Bernhard.Merkle@gmail.com Contact on linkedin.com or xing.com Bernhard Merkle Stop the Software

621 views • 32 slides

Merkles Puzzles See: Merkle, Secrecy, Authentication, and Public Key Systems , UMI Research

Merkles Puzzles See: Merkle, Secrecy, Authentication, and Public Key Systems , UMI Research press, 1982 Merkle, Secure Communications Over Insecure Channels , CACM, Vol. 21, No. 4, pp. 294-299, April 1978 Eli Biham - May 3, 2005 c 206

372 views • 14 slides

( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees

B- B -Trees Trees B B- -Trees Trees Search for key R ( ( ) ) ( ) ( ) = = Work = h log t n B- B -Trees Trees B B- -Trees Trees Each Disk-Read or Disk-Write = one Basic unit of work O(1) Typical Node x

287 views • 4 slides

A Decentralized Solution for Integrating Large Scale UAS Operations into Future Aviation System

ICAO DRONE ENABLE/2 Symposium Chengdu, China September 13, 2018 White Paper Presentation A Decentralized Solution for Integrating Large Scale UAS Operations into Future Aviation System Presentation is Developed in Technical Collaboration with

269 views • 8 slides

15-150 Fall 2020 Lecture 8 Stephen Brookes trees vs. lists Representing a collection as a

15-150 Fall 2020 Lecture 8 Stephen Brookes trees vs. lists Representing a collection as a tree may enable a parallel speed-up Using a sorted tree may enable faster code, e.g. for searching With lists, even sorted lists, theres less

1.03k views • 84 slides

State-of-the-art Multicore Debugging and Tracing concepts by Alexander Merkle, Lauterbach GmbH

State-of-the-art Multicore Debugging and Tracing concepts by Alexander Merkle, Lauterbach GmbH State-of-the-art Multicore Debug & Trace Alexander Merkle 2013 / 11 / 14 www.lauterbach.com 1 / 20 Agenda AMP or SMP introduction

388 views • 20 slides

A Decentralized and Distributed E-voting Scheme Based on Cryptographic Shuffles Decentralized

A Decentralized and Distributed E-voting Scheme Based on Cryptographic Shuffles Decentralized and Distributed Systems Laboratory Andy Caforio Responsible: Prof. Bryan Ford Supervision: Linus Gasser, Philipp Jovanovic 1 Way back when

445 views • 20 slides

/ + - * * 5 3 2 6 5 2 Examples Binary Trees BSTs Augmenting BinExpr General Trees

Trees Readings: HtDP , sections 14, 15, 16. Topics: Introductory examples and terminology Binary trees Binary search trees Augmenting trees Binary expression trees General arithmetic expression trees Nested lists Examples Binary Trees

1.19k views • 31 slides

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees, binary search trees, and AVL and B-Trees. 2 Trees Trees are recursive data structures. They are useful for: representing items that have a tree

622 views • 27 slides

2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes store 1, 2, or 3 keys and have 2, 3, or 4 children, respectively All leaves have the same depth k n r b e h n r b e

800 views • 31 slides

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees) Albert-Ludwigs-Universitt Freiburg Prof. Dr. Rolf Backofen Bioinformatics Group / Department of Computer Science Algorithms and Data Structures, January

884 views • 55 slides

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees

AVL TREES Height Balance : AVL Trees h 1 h 2 | h - h | 1 AVL AVL 2 1 non-AVL trees AVL trees S. Prasitjutrakul 1994 AVL Trees : I nsertion m m k k k u u k k m m v t u m m t t u k m u k u p v t k p v v

320 views • 16 slides

Decentralized Trust Management for Decentralized Trust Management for Ad-Hoc Peer-to-Peer

Decentralized Trust Management for Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University of California,

1.41k views • 29 slides

Decentralized Clinical Trials In 2020: A Global Survey Decentralized and Hybrid Trials 2020

Decentralized Clinical Trials In 2020: A Global Survey Decentralized and Hybrid Trials 2020 Global research study into adoption and technologies 21 July 2020 Presenters Pharma Intelligence and Informa Connect Daniel Chancellor Director,

796 views • 27 slides

Decentralized Consensus Proto cols 1 Goals of the lecture Decentralized Consensus

Decentralized Consensus Proto cols 1 Goals of the lecture Decentralized Consensus Proto cols V erication of Synchronous Proto cols Algo rithms fo r computing functions of global state. Bermond, Konig,

263 views • 13 slides

OpenAPM The Initiative for Open, Tailored APM Solutions Philipp Merkle, Alexander Wert 1

OpenAPM The Initiative for Open, Tailored APM Solutions Philipp Merkle, Alexander Wert 1 Application Performance Management (APM) Application Backend Hardware Users & Clients Network 2 The Top Dogs Dynatrace AppDynamics

389 views • 12 slides

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees

Trees I think that I shall never see Trees I A poem lovely as a tree -- J. Kilmer Trees Anatomy of a Tree a In CS, we look at trees Node from the bottom up Basic element of the tree b c Contains a piece of

321 views • 5 slides

Trees Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck

Trees Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 29, 2016 Another Special Type of Graph: Trees Trees 1. Definitions of trees 2. Properties of trees 3. Revisiting uses of

837 views • 37 slides

Trees a tree represents a hierarchy - organization structure of a corporation Electronics

T REES trees binary trees traversals of trees template method pattern data structures for trees Trees 1 Trees a tree represents a hierarchy - organization structure of a corporation Electronics RUs R&D

434 views • 18 slides

Trees Applied Multivariate Statistics Spring 2012 Overview Intuition for Trees

Trees Applied Multivariate Statistics Spring 2012 Overview Intuition for Trees Regression Trees Classification Trees 1 Idea of Trees: Regression Trees Continuous response Binary Tree y Y=1.2 X 1 X>1 Y=1.4 Y=0.7 2 X

767 views • 17 slides

Parallel Computing Daniel Merkle Course Introduction Communication media:

Parallel Computing Daniel Merkle Course Introduction Communication media: http://www.imada.shu.dk/~daniel/parallel Personal Mail: daniel@imada.sdu.dk Schedule: Tuesday 8.00 ct, Thursday 12.00 ct (if necessary) 2

458 views • 27 slides