More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
Abstract
The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case. In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first time, that there exist specific algorithms for which multiple servers can overcome known lower bounds in the single-server setting.
Cite
@article{arxiv.1809.00825,
title = {More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting},
author = {T-H. Hubert Chan and Jonathan Katz and Kartik Nayak and Antigoni Polychroniadou and Elaine Shi},
journal= {arXiv preprint arXiv:1809.00825},
year = {2018}
}
Comments
36 pages, Accepted in Asiacrypt 2018