The following pages link to (Q5875778):
Displaying 9 items.
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes (Q2571970) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- (Q4551342) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
