The following pages link to Theory of Cryptography (Q5901775):
Displaying 10 items.
- 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)
- A minimal model for secure computation (extended abstract) (Q2817650) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- Secure non-interactive reducibility is decidable (Q6169412) (← links)
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions (Q6169552) (← links)