log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Practical Garbled RAM: GRAM with O(log^2 n) Overhead
Friday, December 3, 2021, 1:00-2:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract
Garbled RAM (GRAM) is a powerful technique that equips Garbled Circuit (GC) with a sublinear cost RAM without adding rounds of interaction. While GRAM constructions are known, none are suitable for practice, due to costs that have high constants and poor scaling.

In this talk, I will present the first GRAM suitable for practice. For computational security parameter κ and for a size-n RAM that stores blocks of size w = Ω(log2 n) bits, our GRAM incurs only amortized O(wκ log2 n) communication and computation per access. We evaluated the concrete cost of our GRAM; our approach outperforms trivial linear-scan-based RAM for as few as 512 128-bit elements.
 
https://eprint.iacr.org/2021/1519
===========
also on Zoom:

https://umd.zoom.us/j/97585901703?pwd=T1hBZFFMdnV5VXdiaVdtaWo0RnNmZz09

Meeting ID: 975 8590 1703

Passcode: lattices??

This talk is organized by David Miller