PRAC: Round-Efficient 3-Party MPC for Dynamic Data Structures

ePrint Report: PRAC: Round-Efficient 3-Party MPC for Dynamic Data Structures

Sajin Sasy, Adithya Vadapalli, Ian Goldberg

We present Private Random Access Computations (PRAC), a 3-party Secure Multi-Party Computation (MPC) framework to support random-access data structure algorithms for MPC with efficient communication in terms of rounds and bandwidth. PRAC extends the state-of-the-art DORAM Duoram with a new implementation, more flexibility in how the DORAM memory is shared, and support for Incremental and Wide DPFs. We then use these DPF extensions to …

access algorithms art bandwidth communication computation data dynamic eprint report framework ian mpc party private random report state structure support terms