Research:

I am interested in security and data privacy in cloud computing. I am currently working on privacy-preserving access to remote data storage, verification of outsourced computation and data integrity protocols.

Oblivious Access to Outsourced Storage:

• Graph Drawing in the Cloud: Privately Visualizing Relational Data using Small Working Storage (pdf)

  GD 2012: International Symposium on Graph Drawing

  M. Goodrich, O. Ohrimenko and R. Tamassia

• Practical Oblivious Storage (pdf)

  CODASPY 2012: ACM Conference on Data and Application Security and Privacy

  M. Goodrich, M. Mitzenmacher, O. Ohrimenko and R. Tamassia

• Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation (pdf)

  SODA 2012: Symposium on Discrete Algorithms

  M. Goodrich, M. Mitzenmacher, O. Ohrimenko and R. Tamassia

• Oblivious RAM Simulation with Efficient Worst-Case Access Overhead (pdf)

  CCSW 2011: ACM Cloud Computing Security Workshop at CCS

  M. Goodrich, M. Mitzenmacher, O. Ohrimenko and R. Tamassia

Authentication of Search Results:

• Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers (pdf)

  PVLDB 2012: Research Track for Very Large Data Bases (Journal)

  M. Goodrich, D. Nguyen, O. Ohrimenko, C. Papamanthou, R. Tamassia, N. Triandopoulos and C. Lopes

• Authenticating Email Search Result

  STM 2012 International Workshop on Security and Trust Management at ESORICS

  O. Ohrimenko, H. Reynolds and R. Tamassia

In theory:

• Lower Bounds for Randomized Algorithms for Online Chain Partitioning

  IPL 2012: Information Processing Letters Volume 112 (Journal)

  C. Mathieu and O. Ohrimenko

My Honors project was in Constraint Programming and I was lucky to be advised by Peter Stuckey:

• Propagation via Lazy Clause Generation (pdf)

  Constraints 2009: Constraints Journal, Volume 14 (Journal)

  O. Ohrimenko, P. Stuckey, and M. Codish

• Propagation = Lazy Clause Generation (Best Student Paper Award) (pdf)

  CP 2007: Principles and Practice of Constraint Programming

  O. Ohrimenko, P. Stuckey, and M. Codish

• Modelling for Lazy Clause Generation (pdf)

  CATS 2008: Computing: the Australasian Theory Symposium

  O. Ohrimenko and P. Stuckey

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

  A. Harwood and O. Ohrimenko (pdf)