Secure multiparty computation with minimal interaction
From MaRDI portal
Recommendations
Cited in
(47)- Two-round MPC: information-theoretic and black-box
- Two-round multiparty secure computation from minimal assumptions
- Secure computation with low communication from cross-checking
- Round-optimal secure multiparty computation with honest majority
- Placing conditional disclosure of secrets in the communication complexity universe
- MPC with friends and foes
- Broadcast-optimal two-round MPC
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
- Broadcast-optimal two round MPC with an honest majority
- On the round complexity of black-box secure MPC
- Round-optimal and communication-efficient multiparty computation
- Round-optimal black-box protocol compilers
- On the exact round complexity of best-of-both-worlds multi-party computation
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- On actively-secure elementary MPC reductions
- On communication models and best-achievable security in two-round MPC
- Secure multiparty computation with general interaction patterns
- Secure two-party computation with low communication
- Secure computation with minimal interaction, revisited
- Secure multi-party computation minimizing online rounds
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1942420 (Why is no real title available?)
- Placing conditional disclosure of secrets in the communication complexity universe
- Perfect secure computation in two rounds
- A little honesty goes a long way. The two-tier model for secure multiparty computation
- Ad hoc PSM protocols: secure computation without coordination
- A Single Initialization Server for Multi-party Cryptography
- Unconditionally secure computation with reduced interaction
- TinyKeys: a new approach to efficient multi-party computation
- On the exact round complexity of secure three-party computation
- Minimizing setup in broadcast-optimal two round MPC
- Round-optimal black-box secure computation from two-round malicious OT
- Fully-secure MPC with minimal trust
- Interaction-preserving compilers for secure computation
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Round-optimal black-box MPC in the plain model
- On the correlation complexity of MPC with cheater identification
- Three party secure computation with friends and foes
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- Threshold-optimal MPC with friends and foes
- Black-box constant-round secure 2PC with succinct communication
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Efficient multiparty private simultaneous messages for symmetric functions
- Secure computation with parallel calls to 2-ary functions
- Non-interactive secure computation with constant communication overhead
- On the communication complexity of PSM and CDS for symmetric functions
This page was built for publication: Secure multiparty computation with minimal interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582778)
