Pages that link to "Item:Q1784103"
From MaRDI portal
The following pages link to Promise zero knowledge and its applications to round optimal MPC (Q1784103):
Displaying 16 items.
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← 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)
- 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)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
