Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue

Name: Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue
Uploaded: 2020-01-01
Duration: 16 min 21 s
Description: Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue — a 2020 IEEE Security & Privacy 2020 security conference talk on exploit-dev, crypto (16:21 min). Watch the full video, indexed free on the Breach Arc Archive.

IEEE Security & Privacy 2020 · 2020 · 16:21

▶

Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue — a 2020 IEEE Security & Privacy 2020 security conference talk on exploit-dev, crypto (16:21 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

exploit-dev crypto

← Back to the Breach Arc Archive