TWORAM - Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

Explore a comprehensive lecture on TWORAM, an efficient Oblivious RAM protocol, and its applications to searchable encryption. Delve into the motivation behind Oblivious RAM, examine existing work, and understand the concept of Non-Interactive Oblivious RAM. Investigate the Path Problem and its relation to Fully Homomorphic Encryption. Analyze the cost of the algorithm and its implications for searchable encryption. Conclude by exploring adaptive computation in this context. This 25-minute presentation by Sanjam Garg, Payman Mohassel, and Charalampos Papamanthou from Crypto 2016 offers valuable insights into cutting-edge cryptographic techniques.

Motivation
Oblivious RAM
Existing work
NonInteractive Oblivious RAM
Path
Problem
Fully Homomorphic Encryption
Cost of Algorithm
Searchable Encryption
Adaptive Computation