Secure two-party computation in sublinear (amortized) time
By S. D. Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis. 2012
199 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
- David E. Evans
- Adrià Gascón
- Marcel Keller
- Farinaz Koushanfar
- Thomas Schneider
- Mike Rosulek
- Xiao Shaun Wang
- Mariana Raykova
In Computational Theory and Mathematics
- David E. Evans
- Marcel Keller
- Thomas Schneider
- Xiao Shaun Wang
- Farinaz Koushanfar
- Adrià Gascón
- Mike Rosulek
- Samee Zahur
Citations in the corpus
- Privacy-Preserving Distributed Linear Regression on High-Dimensional Data (2017, methodology): “Popular applications used for the empirical evaluation of practical MPC systems include graph algorithms [5, 32, 42, 51, 57], data structure algorithms [42, 51], string matching and distance algorithms [36, 37, 66] and AES [3, 36, 37, 66].”
- Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound (2015, methodology): “It is well-understood that ORAM carries the promise of scaling MPC to big data [32, 52].”
- A Pragmatic Introduction to Secure Multi-Party Computation (2019, background): “In (Gordon et al., 2012), the ORAM state is jointly maintained by both parties (client and server) within a secure computation protocol.”
- Secure Linear Regression on Vertically Partitioned Datasets (2016, methodology): “Popular applications used for the empirical evaluation of implemented systems include graph algorithms [6, 18, 24, 29, 34, 45], data structure algorithms [24,29,42], string matching and distance algorithms [20,21,39] and AES [4,20,21,39].”
- Obliv-C: A Language for Extensible Data-Oblivious Computation (2015, unknown): “[9].”
- More efficient oblivious transfer and extensions for faster secure computation (2013, unknown): “Accordingly, the efficient instantiation of OT is of crucial importance as is evident in many recent works that focus on efficiency, e.g., [8,16,19,22–24, 26, 34, 37, 43, 49 ].”
- Efficient, Oblivious Data Structures for MPC (2014, methodology): “Other than the works already discussed [10,16,25], Gentry et al.”
- TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits (2015, methodology): “One alternative approach for hiding memory access patterns is the use of Oblivious Random-Access Machine (ORAM) protocols [27] which allows oblivious load/store operations with amortized polylogarithmic overhead [25], [28], [51], [52].”