Oblivious RAM for MPC

on YouTube ↗35m

" summary

Claims a practical speedup: secure computation of ORAM using Tree ORAM plus honest‑majority three‑party MPC (one corrupt) replaces costly 2PC garbled circuits. Core tools are Yao‑style garbling, OT extension and a three‑party precomputed OT trick, plus protocol tweaks for eviction. Result shrinks per‑access circuit size to about 69K–233K gates (versus millions previously), keeps asymptotic overhead ≈ O(log^3 N), and reports an implementation that closely matches native ORAM performance.

AI-written summary · about

" chapters (11)

1. 0:00Intro
2. 0:28Outline
3. 3:48Secure Computation Primitive
4. 6:50Application
5. 10:29Security
6. 12:02Generic
7. 16:49Three Parties
8. 25:19Technical Details
9. 28:04The Client
10. 32:04The Eviction
11. 33:04Conclusion

" related talks

• 01h 15mOblivious RAM IElaine Shi, Daniel Wichs · Cryptography Boot Camp 2015
• 01h 06mOblivious RAM IIElaine Shi, Daniel Wichs · Cryptography Boot Camp 2015
• 01h 08mSecure Computation 1Peter Scholl · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 14mPrivate Information Retrieval and Oblivious RAMElaine Shi · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round CollapsingVipul Goyal · Secure Computation 2025
• 01h 11mPrivate Information Retrieval and Oblivious RAMElaine Shi · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 40mApplied MPCNigel Smart · RSAC 2021
• 01h 03mSecure Computation 2Elette Boyle · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025