Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation

Name: Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation
Uploaded: 2016-01-01
Duration: 14 min 22 s
Description: Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation — a 2016 IEEE Security & Privacy 2016 (May 23, 2016) security conference talk on crypto (14:22 min). Watch the full video, indexed free on the Breach Arc Archive.

IEEE Security & Privacy 2016 (May 23, 2016) · 2016 · 14:22

▶

Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation — a 2016 IEEE Security & Privacy 2016 (May 23, 2016) security conference talk on crypto (14:22 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive