Two round information-theoretic MPC with malicious security
From MaRDI portal
(Redirected from Publication:2292884)
Recommendations
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Best possible information-theoretic MPC
- Two-round MPC: information-theoretic and black-box
- Two-round Multiparty Secure Computation from Minimal Assumptions
- Two-round multiparty secure computation from minimal assumptions
Cited in
(19)- Black-box transformations from passive to covert security with public verifiability
- Broadcast-optimal two-round MPC
- Broadcast-optimal two round MPC with an honest majority
- Round-optimal multi-party computation with identifiable abort
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On actively-secure elementary MPC reductions
- On communication models and best-achievable security in two-round MPC
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- On the exact round complexity of secure three-party computation
- Minimizing setup in broadcast-optimal two round MPC
- mrNISC from LWE with polynomial modulus
- mrNISC from LWE with polynomial modulus
- The round complexity of statistical MPC with optimal resiliency
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Secure computation with parallel calls to 2-ary functions
- Honest majority constant-round MPC with linear communication from one-way functions
This page was built for publication: Two round information-theoretic MPC with malicious security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292884)
