Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

DOI10.1007/978-3-662-48000-7_36zbMath1352.94027OpenAlexW2295522738MaRDI QIDQ3457093

Rafael Pass, Elette Boyle, Kai-Min Chung

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_36

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (18)

Perfectly secure oblivious parallel RAM ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Secure multi-party computation in large networks ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Unnamed Item ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Must the communication graph of MPC protocols be an expander? ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ From fairness to full security in multiparty computation ⋮ Oblivious Parallel RAM and Applications ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Network Oblivious Transfer

Cites Work

• Optimizing ORAM and Using It Efficiently for Secure Computation
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Perfectly Secure Oblivious RAM without Random Oracles
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Software protection and simulation on oblivious RAMs
• Communication Locality in Secure Multi-party Computation
• Distributed Oblivious RAM for Secure Two-Party Computation
• Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
• Scalable Secure Multiparty Computation

This page was built for publication: Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs