I am a postdoctoral researcher in Constructive Security and Programming Principles and Tools groups at MSR Cambridge, UK. I am also the Microsoft Fellow at Darwin College, Cambridge University. Before MSR I was a Ph.D. student at Brown University working with Roberto Tamassia.
I am interested in security and data privacy of cloud storage and computation including private access to remote storage, verification of outsourced computation and data integrity protocols. My other interests include algorithms, data structures and theory.
Sorting and Searching Behind the Curtain, with F. Baldimtsi. To appear in Financial Crypto 2015.
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud, with M. T. Goodrich, R. Tamassia and E. Upfal (pdf) in ICALP 2014. In the media: ACM Tech News, The Register, Business Cloud News, CloudPro and Bruce Schneier's blog.
Haze: Privacy-Preserving Real-Time Traffic Statistics, with J. Brown and R. Tamassia in SIGSPATIAL/GIS (full version pdf) 2013.
Private Access to Outsourced Storage:
Authentication of Search Results:
Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers, with M. Goodrich, D. Nguyen, C. Papamanthou, R. Tamassia, N. Triandopoulos and C. Lopes in PVLDB 2012: Research Track for Very Large Data Bases (pdf) (Journal).
Authenticating Email Search Result, with H. Reynolds and R. Tamassia STM 2012 International Workshop on Security and Trust Management at ESORICS.
My Honors project at Melbourne University was in Constraint Programming and I was lucky to be advised by Peter Stuckey:
Propagation = Lazy Clause Generation (Best Student Paper Award), with P. Stuckey and M. Codish in CP 2007: Principles and Practice of Constraint Programming (pdf).
Modelling for Lazy Clause Generation, with P. Stuckey in CATS 2008: Computing: the Australasian Theory Symposium (pdf).
In 2006 I was an RA in Aaron Harwood's peer-to-peer group:
Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems, with A. Harwood (pdf).
Email: oohrim microsoft com