in simple

In this short note, we demonstrate a simple and practical ORAM that enjoys an extremely simple proof of security. Our construction is based on a recent ORAM due to Shi, Chan, Stefanov and Li [SCSL11], but with some crucial modifications, which significantly simply the analysis. ∗Cornell University. {chung,rafael}@cs.cornell.edu Chung is supported in part by NSF Award CCF-1214844 and Pass’ Sloan Fellowship. Pass is supported in part by a Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF Award CNS1217821, NSF CAREER Award CCF-0746990, NSF Award CCF-1214844, AFOSR YIP Award FA9550-10-1-0093, and DARPA and AFRL under contract FA8750-11-20211. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government. Report Documentation Page Form Approved OMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT DATE 29 APR 2013 2. REPORT TYPE 3. DATES COVERED 00-00-2013 to 00-00-2013 4. TITLE AND SUBTITLE A Simple ORAM 5a. CONTRACT NUMBER

[1]  Oded Goldreich,et al.  Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.

[2]  Antoon Bosselaers,et al.  An Attack on the Last Two Rounds of MD4 , 1991, CRYPTO.

[3]  Antoon Bosselaers,et al.  Collisions for the Compressin Function of MD5 , 1994, EUROCRYPT.

[4]  Rafail Ostrovsky,et al.  Software protection and simulation on oblivious RAMs , 1996, JACM.

[5]  Alan Rosenthal,et al.  Writing, Directing, and Producing Documentary Films and Videos , 1996 .

[6]  Scott O. Bradner,et al.  Key words for use in RFCs to Indicate Requirement Levels , 1997, RFC.

[7]  Barry Hampe,et al.  Making Documentary Films and Reality Videos: A Practical Guide to Planning, Filming, and Editing Documentaries of Real Events , 1997 .

[8]  Ryan Moats,et al.  URN Syntax , 1997, RFC.

[9]  Rafail Ostrovsky,et al.  Private information storage (extended abstract) , 1997, STOC '97.

[10]  Thomas Narten,et al.  Guidelines for Writing an IANA Considerations Section in RFCs , 1998, RFC.

[11]  Hans Dobbertin,et al.  Cryptanalysis of MD4 , 1996, Journal of Cryptology.

[12]  Ryan Moats,et al.  A URN Namespace for IETF Documents , 1999, RFC.

[13]  Hiroyasu Sugano,et al.  A Model for Presence and Instant Messaging , 2000, RFC.

[14]  C. M. Sperberg-McQueen,et al.  eXtensible Markup Language (XML) 1.0 (Second Edition) , 2000 .

[15]  Christine L. Lisetti Personality, Affect and Emotion Taxonomy for Socially Intelligent Agents , 2002, FLAIRS Conference.

[16]  J. Lennox CPL : A Language for User Control of Internet Telephony Service , 2002 .

[17]  John Jackman,et al.  Lighting for Digital Video and Television , 2020 .

[18]  Henning Schulzrinne,et al.  Call Processing Language (CPL): A Language for User Control of Internet Telephony Services , 2004, RFC.

[19]  Jon Peterson,et al.  Presence Information Data Format (PIDF) , 2004, RFC.

[20]  Dengguo Feng,et al.  Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..

[21]  Michael Mealling,et al.  The IETF XML Registry , 2004, RFC.

[22]  Jonathan D. Rosenberg A Presence Event Package for the Session Initiation Protocol (SIP) , 2004, RFC.