The following pages link to Secure MPC: laziness leads to GOD (Q2691583):
Displaying 11 items.
- Multi-input laconic function evaluation (Q2030877) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption (Q2697678) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- MPC with delayed parties over star-like networks (Q6595681) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- Witness semantic security (Q6637541) (← links)