Education:
2008-current:
Ph.D. Candidate, Computer Science
2008-2010:
Masters in Computer Science
Brown University
2004-2007:
Bachelor of Computer Science (Hons)
Research:
My Ph.D. advisor is Roberto Tamassia and I'm currently working on data integrity protocols and privacy-preserving access to remote data storage.
- Practical Oblivious Storage. M.Goodrich, M. Mitzenmacher, O. Ohrimenko, R. Tamassia. To appear in CODASPY 2012. (pdf)
- Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. M.Goodrich, M. Mitzenmacher, O. Ohrimenko, R. Tamassia. SODA 2012. (pdf)
- Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. M.Goodrich, M. Mitzenmacher, O. Ohrimenko, R. Tamassia. CCSW 2011. (pdf)
My Honors project was in Constraint Programming and I was lucky to be advised by Peter Stuckey:
- Propagation = Lazy Clause Generation.O. Ohrimenko, P. Stuckey, and M. Codish. CP 2007. Best Student Paper Award (pdf)
- Modelling for Lazy Clause Generation. O. Ohrimenko, P. Stuckey. CATS 2008 (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. A. Harwood and O. Ohrimenko. 2007 (pdf)
cs brown edu