log in  |  register  |  feedback?  |  help  |  web accessibility
A Language for Probabilistically Oblivious Computation
Ian Sweet - UMD
Friday, December 7, 2018, 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)

An oblivious computation is one that is free of direct and indirect information leaks, e.g., due to observable differences in timing and memory access patterns. In this talk I will present L-obliv, a core language whose type system enforces obliviousness. Prior work on type-enforced oblivious computation has focused on deterministic programs. Lobliv is new in its consideration of programs that implement probabilistic algorithms, such as those involved in cryptography. I will demonstrate how L-obliv can be used to implement oblivious data structures and software ORAMs.

To read the paper, please check: http://www.cs.umd.edu/~mwh/papers/darais17obliv.html

This talk is organized by Huijing Gong