Pages that link to "Item:Q2175906"
From MaRDI portal
The following pages link to A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906):
Displaying 11 items.
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Round-optimal oblivious transfer and MPC from computational CSIDH (Q6070767) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- Reusable secure computation in the plain model (Q6186599) (← links)