Pages that link to "Item:Q2152066"
From MaRDI portal
The following pages link to Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066):
Displaying 10 items.
- Fast large-scale honest-majority MPC for malicious adversaries (Q775948) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Insured MPC: efficient secure computation with financial penalties (Q2226602) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC (Q5002786) (← links)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation (Q5261693) (← links)
- MPC vs. SFE: Perfect Security in a Unified Corruption Model (Q5445509) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
