Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
From MaRDI portal
Recommendations
- Efficient maliciously secure multiparty computation for RAM
- Secure multiparty RAM computation in constant rounds
- Secure multi-party computation in large networks
- Scalable Secure Multiparty Computation
- scientific article; zbMATH DE number 1583776
- scientific article; zbMATH DE number 1583939
- Scalable and Unconditionally Secure Multiparty Computation
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
Cites work
- Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
- Communication Locality in Secure Multi-party Computation
- Distributed Oblivious RAM for Secure Two-Party Computation
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Perfectly secure oblivious RAM without random oracles
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- Software protection and simulation on oblivious RAMs
Cited in
(27)- Adaptive security, erasures, and network assumptions in communication-local MPC
- Gradual GRAM and secure computation for RAM programs
- Adaptively secure computation for RAM programs
- Lower bound framework for differentially private and oblivious data structures
- Is there an oblivious RAM lower bound for online reads?
- Secure computation for big data
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Perfectly secure oblivious parallel RAM
- Simplex consensus: a simple and fast consensus protocol
- Oblivious parallel RAM and applications
- Network oblivious transfer
- Multi-party Indirect Indexing and Applications
- Better two-round adaptive multi-party computation
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Is there an oblivious RAM lower bound for online reads?
- Maliciously secure massively parallel computation for all-but-one corruptions
- Secure multiparty RAM computation in constant rounds
- The bottleneck complexity of secure multiparty computation
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Sublinear-round Byzantine agreement under corrupt majority
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
- Secure multi-party computation in large networks
- Must the communication graph of MPC protocols be an expander?
- Secure computation, I/O-efficient algorithms and distributed signatures
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- On the computational overhead of MPC with dishonest majority
This page was built for publication: Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457093)
