The simulation renders a binary tree of encrypted buckets and shows each read or write triggering a full root-to-leaf path fetch, re-encryption, and random leaf reassignment, illustrating why the observable access pattern never correlates with the actual data touched.
Select a logical block and choose read or write, then watch the highlighted path change on every single operation, including repeats of the same block, and inspect the stash panel to see temporarily displaced blocks.
Block selector, read/write toggle, step button to trigger an access, and a tree view with a stash panel.
Path ORAM assigns the accessed block a brand-new random leaf on every single access, so requesting the exact same block twice in a row still produces two completely unrelated paths through the tree.
The simulation renders a binary tree of encrypted buckets and shows each read or write triggering a full root-to-leaf path fetch, re-encryption, and random leaf reassignment, illustrating why the observable access pattern never correlates with the actual data touched.
The simulation renders a binary tree of encrypted buckets and shows each read or write triggering a full root-to-leaf path fetch, re-encryption, and random leaf reassignment, illustrating why the observable access pattern never correlates with the actual data touched.
Select a logical block and choose read or write, then watch the highlighted path change on every single operation, including repeats of the same block, and inspect the stash panel to see temporarily displaced blocks.
Path ORAM assigns the accessed block a brand-new random leaf on every single access, so requesting the exact same block twice in a row still produces two completely unrelated paths through the tree.