Pages that link to "Item:Q1648848"
From MaRDI portal
The following pages link to Two-round multiparty secure computation from minimal assumptions (Q1648848):
Displaying 13 items.
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
- mrNISC from LWE with polynomial modulus (Q6134835) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels (Q6619925) (← links)
- R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
- Malicious security for SCALES. Outsourced computation with ephemeral servers (Q6653038) (← links)
