We present an algorithm for implementing a secure oblivious
RAM where the access pattern is perfectly hidden in the information
theoretic sense, without assuming that the CPU has access to a random
oracle. In addition we prove a lower bound on the amount of
randomness needed for implementing an information theoretically secure
oblivious RAM.
Joint work with Ivan Damgård and Jesper Buus Nielsen
http://eprint.iacr.org/2010/108
Date and Time:
Thursday, July 14, 2011 - 13:10 to Friday, July 15, 2011 - 14:45
Speaker:
Sigurd Torkel Meldgaard : Title: Perfectly Secure Oblivious RAM without Random Oracles
Location:
Tel Aviv university, Schreiber Building, Room 309