Pages that link to "Item:Q5418721"
From MaRDI portal
The following pages link to A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (Q5418721):
Displaying 12 items.
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- On the structure of unconditional UC hybrid protocols (Q1631320) (← links)
- Towards characterizing securely computable two-party randomized functions (Q1749306) (← links)
- Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
- Secure non-interactive reduction and spectral analysis of correlations (Q2170114) (← links)
- Completeness for symmetric two-party functionalities: revisited (Q2413612) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Completeness in two-party secure computation (Q3580999) (← links)
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions (Q5261630) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- Secure non-interactive reducibility is decidable (Q6169412) (← links)