Efficient multi-party computation: from passive to active security via secure SIMD circuits
From MaRDI portal
Recommendations
- Circuits resilient to additive attacks with applications to secure computation
- The price of active security in cryptographic protocols
- Multiparty computation for dishonest majority: from passive to active security at low cost
- Binary AMD circuits from secure multiparty computation
- Yet another compiler for active security or: efficient MPC over arbitrary rings
Cites work
- An O (log n ) expected rounds randomized byzantine generals protocol
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Founding Cryptography on Oblivious Transfer – Efficiently
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Oblivious Polynomial Evaluation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Secure Arithmetic Computation with No Honest Majority
- Semi-homomorphic encryption and multiparty computation
Cited in
(31)- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Sharing transformation and dishonest majority MPC with packed secret sharing
- On the communication required for unconditionally secure multiplication
- 3-party secure computation for RAMs: optimal and concretely efficient
- Linear overhead optimally-resilient robust MPC using preprocessing
- Round-optimal secure multi-party computation
- Fluid MPC: secure multiparty computation with dynamic participants
- Unconditional communication-efficient MPC via Hall's marriage theorem
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Binary AMD circuits from secure multiparty computation
- Ramp hyper-invertible matrices and their applications to MPC protocols
- An algebraic framework for silent preprocessing with trustless setup and active security
- The price of active security in cryptographic protocols
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Multiparty computation for dishonest majority: from passive to active security at low cost
- 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
- Guaranteed output delivery comes free in honest majority MPC
- The price of active security in cryptographic protocols
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Fast large-scale honest-majority MPC for malicious adversaries
- Non-interactive zero-knowledge proofs to multiple verifiers
- Honest majority MPC with \(\tilde{O}(|C|)\) communication in Minicrypt
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Scalable multiparty computation from non-linear secret sharing
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Circuits resilient to additive attacks with applications to secure computation
This page was built for publication: Efficient multi-party computation: from passive to active security via secure SIMD circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457092)
