Abstract
Secure RAM computation allows a number of parties to evaluate a function represented as a random-access machine (RAM) program in a way that reveals nothing about the private inputs of the parties except from what is already revealed by the function output itself. In this work we present Ramen, which is a new protocol for computing RAM programs securely among three parties, tolerating up to one passive corruption. Ramen provides reasonable asymptotic guarantees and is concretely efficient at the same time. We have implemented our protocol and provide extensive benchmarks for various settings. Asymptotically, our protocol requires a constant number of rounds and an amortized sublinear amount of communication and computation per memory access. In terms of concrete efficiency, our protocol outperforms previous solutions. For a memory of size 2 26 our memory accesses are 25× faster in the LAN and 8× faster in the WAN setting, when compared to the previously fastest, and concurrent, solution by Vadapalli, Henry, and Goldberg (USENIX Security 2023). Due to our superior asymptotic guarantees, the efficiency gap is only widening as the memory gets larger and for this reason Ramen provides the currently most scalable concretely efficient solution for securely computing RAM programs.
| Original language | English |
|---|---|
| Title of host publication | CCS '23 : Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security |
| Number of pages | 14 |
| Place of publication | New York |
| Publisher | Association for Computing Machinery |
| Publication date | 15 Nov 2023 |
| Pages | 3284-3297 |
| ISBN (Electronic) | 979-8-4007-0050-7 |
| DOIs | |
| Publication status | Published - 15 Nov 2023 |
Keywords
- Distributed Oblivious RAM
- Multiparty Computation