Pages that link to "Item:Q2119049"
From MaRDI portal
The following pages link to Round optimal secure multiparty computation from minimal assumptions (Q2119049):
Displaying 23 items.
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits (Q1648849) (← links)
- Promise zero knowledge and its applications to round optimal MPC (Q1784103) (← links)
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS (Q1784443) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF (Q6132415) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
