Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
From MaRDI portal
Recommendations
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- On actively-secure elementary MPC reductions
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- On communication-efficient asynchronous MPC with adaptive security
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- On fully secure MPC with solitary output
- Adaptively secure MPC with sublinear communication complexity
- Adaptively secure MPC with sublinear communication complexity
Cites work
- A Unified Approach to MPC with Preprocessing Using OT
- A new approach to practical active-secure two-party computation
- Actively secure OT extension with optimal overhead
- Dishonest majority multi-party computation for binary circuits
- Efficient constant round multi-party computation combining BMR and SPDZ
- Faster secure two-party computation in the single-execution setting
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Improved Garbled Circuit: Free XOR Gates and Applications
- Low cost constant round MPC combining BMR and oblivious transfer
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Perfectly-Secure MPC with Linear Communication Complexity
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Secure multiparty computation goes live
- Semi-homomorphic encryption and multiparty computation
- TinyKeys: a new approach to efficient multi-party computation
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(12)- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Broadcast-optimal two-round MPC
- Correlated pseudorandomness from expand-accumulate codes
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- TinyKeys: a new approach to efficient multi-party computation
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Putting the online phase on a diet: covert security from short MACs
- Secure multiparty computation with free branching
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- The more the merrier: reducing the cost of large scale MPC
- Secure MPC: laziness leads to GOD
- Actively secure setup for SPDZ
This page was built for publication: Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710665)
