Pages that link to "Item:Q2829225"
From MaRDI portal
The following pages link to On the Communication Required for Unconditionally Secure Multiplication (Q2829225):
Displaying 10 items.
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation (Q2179390) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- (Q5002694) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
