Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue
Presenters detail vulnerability discovery and exploitation in Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue.
Summary
No summary yet — watch the video above, or open it on YouTube.
Related talks
IEEE Symposium on Security and Privacy·21 min
Secure Deletion · History Independence
Industry experts analyze emerging threats surrounding A Practical Oblivious Map Data Structure with Secure Deletion and History Independence.
FIRST·27 min
Presenters detail vulnerability discovery and exploitation in Flipping the Criticality Funnel, A Practical Path to Real Prioritization.
IEEE Symposium on Security and Privacy·14 min
Selective Path Exploration
Security researchers examine technical aspects of SelectFuzz: Efficient Directed Fuzzing with Selective Path Exploration.