Главная
Study mode:
on
1
Intro
2
How to Compute with Private Data?
3
MPC Applications
4
What can we compute securely?
5
Circuits imply linear work
6
Random Access
7
Oblivious RAM GOʻ96
8
Binary Search
9
ORAM Constructions
10
Secure Computation with RAMS
11
Revisiting Square Root ORAM
12
MPC Bottlenecks
13
Basic Construction
14
Dummy Lookups
15
Sampling Radom Element
16
Creating Position Map
17
Inverse permutation
18
Evaluation
19
Per-Access Crossover Points
20
Access time
21
Initialization cost
22
Benchmarks
23
Overview
Description:
Explore secure computation techniques for protecting private data in this comprehensive lecture by Dr. Mariana Raykova from Yale University. Delve into the challenges of hiding memory access patterns in secure computation and discover two innovative approaches addressing this issue. Learn about a new oblivious RAM (ORAM) construction that modifies the classical square-root ORAM to improve efficiency for smaller database sizes. Examine a hybrid encrypted search scheme that reduces leakage in Boolean query solutions by combining ORAM techniques with efficient search index structures. Gain insights into the latest developments in cryptography and security, including secure computation, verifiable computation, and obfuscation. Follow Dr. Raykova's research journey in developing cryptographic techniques that balance data privacy protection with usability and verifiability.

Secure Computation with RAMs - Dr. Mariana Raykova, Yale University

Alan Turing Institute
Add to list