Accueil

Olga Ohrimenko

  1. Oblivious Storage with Low I/O Overhead.

    Tue, 10/11/2011 - 15:01 — SomNambul
    Authors: Michael T. Goodrich, Roberto Tamassia, Michael Mitzenmacher, Olga Ohrimenko
    Subjects: Cryptography and Security
    Abstract

    We study oblivious storage (OS), a natural way to model privacy-preserving
    data outsourcing where a client, Alice, stores sensitive data at an
    honest-but-curious server, Bob. We show that Alice can hide both the content of
    her data and the pattern in which she accesses her data, with high probability,
    using a method that achieves O(1) amortized rounds of communication between her
    and Bob for each data access.

  2. Oblivious RAM Simulation with Efficient Worst-Case Access Overhead.

    Wed, 07/27/2011 - 15:01 — SomNambul
    Authors: Michael T. Goodrich, Roberto Tamassia, Michael Mitzenmacher, Olga Ohrimenko
    Subjects: Cryptography and Security
    Abstract

    Oblivious RAM simulation is a method for achieving confidentiality and
    privacy in cloud computing environments. It involves obscuring the access
    patterns to a remote storage so that the manager of that storage cannot infer
    information about its contents. Existing solutions typically involve small
    amortized overheads for achieving this goal, but nevertheless involve
    potentially huge variations in access times, depending on when they occur. In
    this paper, we show how to de-amortize oblivious RAM simulations, so that each
    access takes a worst-case bounded amount of time.

Math-arch

Syndicate content