Readings on: Hiding access patterns (ORAMs)

Optional background reading: Oded Goldreich and Rafail Ostrovsky. “Software protection and simulation on oblivious RAMs”. J. ACM, 43(3):431–473, May 1996.
[ACM DL]

Main reading for February 27th: Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. “Path ORAM: an extremely simple oblivious RAM protocol”. In ACM Conference on Computer and Communications Security (CCS), pages 299–310, Berlin, Germany, November 2013.
[ACM DL]
You don't have to understand all the combinatorics details in sections 6.3 and 6.4.

Main reading for March 1st: Samee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón, Jack Doerner, David Evans, and Jonathan Katz. “Revisiting Square-Root ORAM: Efficient Random Access in Multi-Party Computation”. In IEEE Symposium on Security and Privacy (“Oakland”), pages 218–234, San Jose, CA, USA, May 2016.
[IEEE]