Pages that link to "Item:Q1784101"
From MaRDI portal
The following pages link to Round-optimal secure multiparty computation with honest majority (Q1784101):
Displaying 31 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Best of both worlds in secure computation, with low communication overhead (Q1656049) (← links)
- A new approach to round-optimal secure multiparty computation (Q1675737) (← links)
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS (Q1784443) (← links)
- Proactive secure multiparty computation with a dishonest majority (Q1796790) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- One-round secure fair meeting location determination based on homomorphic encryption (Q2282275) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels (Q6619925) (← links)
