New Advances in Secure RAM Computation
summary
Claims a black‑box garbled‑RAM construction that relies only on one‑way functions and avoids embedding PRF evaluations inside garbled CPU steps. Memory becomes a garbled memory tree of circuits with bits hardwired; reads invoke subroutine garbled circuits and return labels. Initial upload is linear in database size; per‑program work and communication scale with the program running time. Handles t reads with a 1+ε backup overhead and a moving‑window plus replenishing queue to make reads oblivious.
AI-written summary · about
chapters (11)
- 0:00Two-party Secure Computation...
- 0:23RAM analogue of Garbled circuits
- 1:44More Ambitious: Garbled RAM
- 5:52Landscape: Garbled RAM
- 9:06Outline of the rest of the talk
- 9:29RAM Model
- 13:35GLO15 high level idea
- 19:39How to connect backups?
- 21:26Our Fix: Moving window
- 23:48Security proof other issues
- 24:43Conclusion
