DeepAI AI Chat
Log In Sign Up

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting

by   T-H. Hubert Chan, et al.
University of Maryland
The University of Hong Kong
cornell university

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.


Sub-logarithmic Distributed Oblivious RAM with Small Block Size

Oblivious RAM (ORAM) is a cryptographic primitive that allows a client t...

Improved rate for a multi-server coded caching

Multi-server coded caching, which can further reduce the amount of trans...

Multi-Matrix Verifiable Computation

The problem of securely outsourcing computation to cloud servers has att...

Ship Detection: Parameter Server Variant

Deep learning ship detection in satellite optical imagery suffers from f...

Secure Single-Server Nearly-Identical Image Deduplication

Cloud computing is often utilized for file storage. Clients of cloud sto...

Short-Lived Forward-Secure Delegation for TLS

On today's Internet, combining the end-to-end security of TLS with Conte...