Pages that link to "Item:Q6166963"
From MaRDI portal
The following pages link to Tight bounds on the randomness complexity of secure multiparty computation (Q6166963):
Displaying 11 items.
- Towards characterizing securely computable two-party randomized functions (Q1749306) (← links)
- On the message complexity of secure multiparty computation (Q1749308) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
- Communication and Randomness Lower Bounds for Secure Computation (Q2976700) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
- (Q4535073) (← links)
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle (Q6107739) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols (Q6487419) (← links)
