Learn about parallel garbled RAM in this conference talk presented at Crypto 2017. Explore the paper by Steve Lu and Rafail Ostrovsky on computing with encrypted data. Dive into topics like oblivious RAM, parallel garbled RAM, and the main theorem behind the construction. Examine the garbled tree structure, double tree concept, and circuit logic involved. Understand narrow circuits, circuit consumption, and special levels near the leaves. Follow the simulation sketch and consider open problems in this field of cryptography.
Overview
Syllabus
Introduction
Computing on encrypted data
Motivation
Quick Review
Oblivious RAM
Parallel Garbled RAM
Main Theorem
Main Construction
Garbled Tree
Double Tree
Circuit Logic
Narrow Circuits
Circuit Consumption
Special Level
Near the Leaves
Above the B
Putting it all together
Simulation
Sketch
Open Problems
Taught by
TheIACR
