Pages that link to "Item:Q1690212"
From MaRDI portal
The following pages link to Round-optimal secure two-party computation from trapdoor permutations (Q1690212):
Displaying 11 items.
- Perfect secure computation in two rounds (Q1629404) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← 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)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- (Q3374903) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← 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)