Pages that link to "Item:Q5916238"
From MaRDI portal
The following pages link to Round-optimal secure multi-party computation (Q5916238):
Displayed 19 items.
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) (Q2152174) (← 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)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Statistical security in two-party computation revisited (Q6114269) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)