Pages that link to "Item:Q5445508"
From MaRDI portal
The following pages link to Perfectly-Secure MPC with Linear Communication Complexity (Q5445508):
Displaying 6 items.
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
