Pages that link to "Item:Q1749306"
From MaRDI portal
The following pages link to Towards characterizing securely computable two-party randomized functions (Q1749306):
Displaying 10 items.
- On statistical security in two-party computation (Q2119059) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities (Q4910282) (← links)
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (Q5418721) (← links)
- Theory of Cryptography (Q5901775) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- Randomized functions with high round complexity (Q6581793) (← links)