Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
By Elette Boyle, Kai-Min Chung, Rafael Pass. 2015
68 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- H. Brendan McMahan
- Jakub Konecný
- Adrià Gascón
- Daniel Ramage
- Peter Kairouz
- Amir Salman Avestimehr
- James Bell
- Mariana Raykova
In Computational Theory and Mathematics
- Sarvar Patel
- H. Brendan McMahan
- Adrià Gascón
- Mariana Raykova
- Tancrède Lepoint
- Daniel Ramage
- James Bell
- Kallista A. Bonawitz
Citations in the corpus
- Secure Single-Server Aggregation with (Poly)Logarithmic Overhead (2020, background): “[9] present efficient large-scale secure computation but do use a broadcast channel per party.”
- Path ORAM: an extremely simple oblivious RAM protocol (2012, unknown): “We first describe the Path ORAM protocol with N/χ + O (log N ) · ω (1) blocks of client storage, and then later in Section 3.7 we explain how the client storage can be reduced to O (log 2 N/ log χ ) · ω (1) blocks via recursion.”
- Practical Secure Aggregation for Privacy-Preserving Machine Learning (2017, background): “studied generic MPC at such scale, relying on a particular ORAM construction to help localize the computation and avoid broadcasts [12].”