# [Busec] busec this week: Olya Ohrimenko (Wed 10am)

Sharon Goldberg goldbe at cs.bu.edu
Tue Feb 3 17:38:45 EST 2015

Tomorrow, Olya Ohrimenko from MSR will be speaking about oblivious
shuffling techniques. Lunch will be provided and abstract is below.

See you there,
Sharon

BUsec Calendar:  http://www.bu.edu/cs/busec/
BUsec Mailing list: http://cs-mailman.bu.edu/mailman/listinfo/busec

The busec seminar gratefully acknowledges the support of BU's Center for
Reliable Information Systems and Cyber Security (RISCS).

*****

Olya Ohrimenko. MSR.
Hariri Seminar Room
Wednesday Feb 4, 10-11:30am

A shuffle is an algorithm for rearranging an array to achieve a random
permutation of its elements. Early shuffle methods were motivated by the
problem of shuffling a deck of cards. An oblivious shuffle is a distributed
shuffle executed by a client who permutes an array of encrypted data items
stored at a server in such a way that the server cannot determine the
output permutation with probability better than a random guess. Several
private cloud storage solutions that obfuscate the access pattern to the
data use an oblivious shuffle as a fundamental building block. We present
the Melbourne Shuffle, a simple and efficient oblivious shuffle that allows
a client with O(\sqrt{n}) memory to obliviously shuffle an array of size n
stored at a server by exchanging O(\sqrt{n}) messages of size O(\sqrt{n}).
The Melbourne Shuffle is the first provably secure oblivious shuffle that
is not based on sorting.

This talk is based on the paper “The Melbourne Shuffle: Improving Oblivious
Storage in the Cloud”, appeared in International Colloquium on Automata,
Languages and Programming (ICALP), 2014. Joint work with Michael Goodrich
(UC Irvine), Roberto Tamassia (Brown University) and Eli Upfal (Brown
University).
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/busec/attachments/20150203/a03a7bcf/attachment.html>