Fast large-scale honest-majority MPC for malicious adversaries

Recommendations

Fast large-scale honest-majority MPC for malicious adversaries
Efficient, actively secure MPC with a dishonest majority: a survey
Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
On the computational overhead of MPC with dishonest majority
Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
ATLAS: efficient and scalable MPC in the honest majority setting
Asynchronous MPC with a strict honest majority using non-equivocation
Secure massively parallel computation for dishonest majority
Adaptively secure multi-party computation with dishonest majority
Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries

Cited in

(57)

Minimising communication in honest-majority MPC by batchwise multiplication verification
Robust multiparty computation with faster verification time
Going beyond dual execution: MPC for functions with efficient verification
Order-C secure multiparty computation for highly repetitive circuits
The more the merrier: reducing the cost of large scale MPC
Constant-overhead unconditionally secure multiparty computation over binary fields
Guaranteed output delivery comes free in honest majority MPC
An efficient passive-to-active compiler for honest-majority MPC over rings
The price of active security in cryptographic protocols
Secure massively parallel computation for dishonest majority
Fluid MPC: secure multiparty computation with dynamic participants
ATLAS: efficient and scalable MPC in the honest majority setting
Unconditional communication-efficient MPC via Hall's marriage theorem
The cost of IEEE arithmetic in secure computation
Honest majority MPC with abort with minimal online communication
High throughput secure MPC over small population in hybrid networks (extended abstract)
Secure multiparty computation with free branching
An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
Efficient fully secure computation via distributed zero-knowledge proofs
Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
On the computational overhead of MPC with dishonest majority
High-throughput secure three-party computation for malicious adversaries and an honest majority
Efficient perfectly secure computation with optimal resilience
Efficient perfectly secure computation with optimal resilience
\textsc{SuperPack}: dishonest majority MPC with constant online communication
Le Mans: dynamic and fluid MPC for dishonest majority
Fast large-scale honest-majority MPC for malicious adversaries
MPClan: protocol suite for privacy-conscious computations
Sharing transformation and dishonest majority MPC with packed secret sharing
Attaining GOD beyond honest majority with friends and foes
Non-interactive zero-knowledge proofs to multiple verifiers
Privacy preserving solution of DCOPs by mediation
On linear communication complexity for (maximally) fluid MPC
Efficient secure multi-party computation for proof of custody in Ethereum sharding
DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
3-party secure computation for RAMs: optimal and concretely efficient
MPC with delayed parties over star-like networks
Ramp hyper-invertible matrices and their applications to MPC protocols
Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
The price of active security in cryptographic protocols
MPC for \(\mathcal{Q}_2\) access structures over rings and fields
On information-theoretic secure multiparty computation with local repairability
Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
Scalable agreement protocols with optimal optimistic efficiency
Malicious security in collaborative zk-SNARKs: more than meets the eye
Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
Honest majority MPC with \(\tilde{O}(|C|)\) communication in Minicrypt
Homomorphic secret sharing with verifiable evaluation
Honest majority constant-round MPC with linear communication from one-way functions
Concretely efficient fluid MPC with linear communication
On the power of Sumcheck in secure multiparty computation
Scaling fully secure MPC via robust recursive search and gap amplification
Lower bounds on the bottleneck complexity of secure multiparty computation
Compilation of function representations for secure computing paradigms
Multi-party revocation in sovrin: performance through distributed trust

This page was built for publication: Fast large-scale honest-majority MPC for malicious adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775948)